Leetcode Tree problem collection (3)

• 99.Recover Binary Search Tree
• 94.Binary Tree Inorder Traversal
• 116.Populating Next Right Pointers in Each Node
• 114.Flatten Binary Tree to Linked List
• 654.Maximum Binary Tree
• 106.Construct Binary Tree from Inorder and Postorder Traversal

Leetcode Tree problem collection (2)

• 199.Binary Tree Right Side View
• 105.Construct Binary Tree from Preorder and Inorder Traversal
• 236.Lowest Common Ancestor of a Binary Tree
• 987.Vertical Order Traversal of a Binary Tree
• 103.Binary Tree Zigzag Level Order Traversal

Leetcode Tree problem collection (1)

• 104.Maximum Depth of Binary Tree
• 98.Validate Binary Search Tree
• 101.Symmetric Tree
• 102.Binary Tree Level Order Traversal
• 108.Convert Sorted Array to Binary Search Tree

Inorder (Left, Root, Right)
Preorder (Root, Left, Right)
Postorder (Left, Right, Root)