Watch: Exploring Binary Trees (Part 2) — Braata 1 — Haskell
Deserializing a preorder string-encoded binary tree.
In a previous Haskell video, Exploring Binary Trees (Part 2), we implemented three useful functions for extracting values from a Binary Tree into a list. We implemented these functions using the preorder, inorder, and postorder traversal strategies.
If you are not familiar with these strategies for traversing binary trees, I highly encourage you to watch the Exploring Binary Trees (Part 2) video before continuing with this one.
This is a braata video. And if you don’t know what that means, it just means its a little supm supm extra.
In the comments section for the Exploring Binary Trees (Part 2) video, viewer Zoasis posed a related problem. This video presents a solution to that problem.
Watch the video here
Find the source code on GitHub
Thank you for watching. Please LIKE and SUBSCRIBE to show your support and watch more videos like this one.
Videos you should watch next
- Run-length Encoding and Decoding — Coding Problem — Haskell
- Run-length Encoding and Decoding (Braata) — Coding Problem — Haskell
- Longest Substring With At Most K Distinct Characters — Coding Problem — Haskell
More Computing Resources
Watch more videos covering a variety of topics in Computing at OnelTalksTech.com
