list of standard Tree problems which are solved in this repo with explaination
- 104. Maximum Depth of Binary Tree (easy)
- 559. Maximum Depth of N-ary Tree (easy)
- 144. Binary Tree Preorder Traversal (easy)
- 589. N-ary Tree Preorder Traversal (easy)
- 617. Merge Two Binary Trees (easy)
- 965. Univalued Binary Tree (easy)
- 1022. Sum of Root To Leaf Binary Numbers (easy)
- 872. Leaf-Similar Trees (easy)
- 257. Binary Tree Paths (easy)
- 404. Sum of Left Leaves (easy)
- 112. Path Sum (easy)
- 993. Cousins in Binary Tree (easy)
- 100. Same Tree (easy)
- 116. Populating Next Right Pointers in Each Node (medium)
##Binary Search Trees