Hard (14)

1. Print root to leaf path in BT
   • LeetCode
   • GeeksforGeeks
   • Sum
2. LCA in BT
3. Maximum Width of BT
4. Children Sum Property in Binary Tree
5. Print all nodes at a distance of K in BT
6. Minimum time taken to burn the BT from a given Node
7. Count total nodes in a complete BT
8. Requirements needed to construct a unique BT
   • LeetCode
   • GeeksforGeeks
9. Construct a BT from Preorder and Inorder
10. Construct the Binary Tree from Postorder and Inorder Traversal
11. Serialize and De-serialize BT
12. Morris Preorder Traversal of a Binary Tree
13. Morris Inorder Traversal of a Binary Tree
14. Flatten Binary Tree to Linked List