Learn Tree, BST - Githubissues

[x] Maximum Depth of Binary Tree (Easy) - 3+3 min
[x] Minimum Depth of Binary Tree (Easy) - 0 min(already solved and understandable)
[x] Merge Two Binary Trees (Easy) - 5+10min
[x] Convert Sorted Array to Binary Search Tree (Easy)
[x] Path Sum (Easy) -
[x] Binary Tree Level Order Traversal (Medium) - 3+7min
[x] Binary Tree Zigzag Level Order Traversal (Medium) - 3+6min
[x] Validate Binary Search Tree (Medium) - 57min MUST RETRY
[ ] Construct Binary Tree from Preorder and Inorder Traversal (Medium)

yukisato / algorithms