msb-public
/
tech-interview-handbook
mirror of https://github.com/yangshun/tech-interview-handbook
2
1
Code Issues Projects Releases Wiki Activity

Recommended Resources for Tree Traversal

Browse Source 
Hi, I found these useful pages for in-detail implementation of tree traversal methods (both Iterative and Recursive Approach), especially for beginners.

Preorder (Iterative & Recursive) --> https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/
Inorder (Iterative & Recursive) --> https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/
Postorder (Iterative & Recursive) --> https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/
pull/258/head
Michael Chu 4 years ago committed by GitHub
parent 96e169c0cb
commit aae4260221
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File

4
contents/algorithms/tree.md
Unescape View File

@ -38,6 +38,10 @@ Do check out the section on [Trie](trie.md), which is an advanced tree.
In-order traversal of a binary tree is insufficient to uniquely serialize a tree. Pre-order or post-order traversal is also required. In-order traversal of a binary tree is insufficient to uniquely serialize a tree. Pre-order or post-order traversal is also required.
[Pre-order Traversal](https://www.techiedelight.com/preorder-tree-traversal-iterative-recursive/)
[In-order Traversal](https://www.techiedelight.com/inorder-tree-traversal-iterative-recursive/)
[Post-order Traversal]( https://www.techiedelight.com/postorder-tree-traversal-iterative-recursive/)
### Binary Search Tree (BST) ### Binary Search Tree (BST)
In-order traversal of a BST will give you all elements in order. In-order traversal of a BST will give you all elements in order.

Write Preview
Loading…
Cancel
Save