LeetCode - Tree 总结

Preorder, Inorder, Postorder and Level order Traversal

Construct Binary Tree from Preorder and Inorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal

Construct Binary Tree from Preorder and Postorder Traversal [exist multiple solutions]

Binary Tree Preorder Traversal

Binary Tree Inorder Traversal

Inorder Successor in BST

Closest Binary Search Tree Value II [inorder]

Kth Smallest Element in a BST [inorder]

Binary Tree Level Order Traversal

Binary Tree Zigzag Level Order Traversal

Binary Tree Vertical Order Traversal

Binary Search Tree

Validate Binary Search Tree

Unique Binary Search Trees, II (construct the actual trees)

Recover Binary Search Tree

Convert Sorted List to Binary Search Tree

Lowest Common Ancestor

Lowest Common Ancestor of a Binary Search Tree

Lowest Common Ancestor of a Binary Tree

Design

Serialize and Deserialize Binary Tree

Serialize and Deserialize BST [hehe, same as the above one]

Serialize and Deserialize N-ary Tree

Binary Search Tree Iterator

Find Median from Data Steam

Design Search Autocomplete System

LRU Cache

LFU Cache

Sum of Distance in Tree

All O'one Data Structure

Insert Delete GetRandom O(1) - Duplicates allowed

String

Construct String from Binary Tree

Contruct Binary Tree from String

Linked List

Flatten Binary Tree to Linked List

Convert Binary Search Tree to Sorted Doubly Linked List

Other

Symmetric Tree

Binary Tree Right Side View

Balanced Binary Tree [depth of the tree]

Binary Tree Maximum Path Sum

Populating Next Right Pointers in Each Node, II

Merge Two Binary Trees

Count Univalue Subtrees

Kill Process