Binary tree traversal

**Basic Abstractions**

Name | Summary |
---|---|

Common tree traversal | preorder (MLR), inorder(LMR), postorder(LRM) |

Advanced tree traversal | morris |

**Scenarios**

**Code Skeleton**

**Questions**

See all treetraversal tree problems: #treetraversal

- Review: Binary tree traversal
- Leetcode: Univalued Binary Tree
- Leetcode: Symmetric Tree
- Leetcode: N-ary Tree Preorder Traversal
- Leetcode: N-ary Tree Postorder Traversal
- Leetcode: N-ary Tree Level Order Traversal
- Leetcode: Maximum Depth of N-ary Tree
- Leetcode: Inorder Successor in BST
- Leetcode: Increasing Order Search Tree
- Leetcode: Distribute Coins in Binary Tree
- Leetcode: Convert BST to Greater Tree
- Leetcode: Convert Binary Search Tree to Sorted Doubly Linked List
- Leetcode: Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode: Construct Binary Tree from Inorder and Postorder Traversal
- Leetcode: Closest Leaf in a Binary Tree
- Leetcode: Binary Tree Zigzag Level Order Traversal
- Leetcode: Binary Tree Preorder Traversal
- Leetcode: Binary Tree Longest Consecutive Sequence II
- Leetcode: Binary Tree Longest Consecutive Sequence
- Leetcode: Binary Tree Level Order Traversal II
- Leetcode: Binary Tree Level Order Traversal
- Leetcode: Binary Tree Inorder Traversal
- Leetcode: Binary Search Tree to Greater Sum Tree

See more blog_posts.