Binary tree traversal

**Basic Abstractions**

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

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

Advanced tree traversal | morris |

**Scenarios**

**Code Skeleton**

**Top 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.