- Create a Binary Tree. Also write inorder traversal for the tree.
- Create a Binary Tree. Write pre-order & post-order traversals for the Binary Tree.
- Create a Binary Search Tree (BST). Write in-order, pre-order & post-order traversals for the Tree.
- 100. Same Tree
- 101. Symmetric Tree
- 104. Maximum Depth of Binary Tree
- 404. Sum of Left Leaves
- 112. Path Sum
- 113. Path Sum II
- 102. Binary Tree Level Order Traversal
- Tasks -
- Iterative solution only - 94. Binary Tree Inorder Traversal
- Iterative solution only - 144. Binary Tree Preorder Traversal
- Iterative solution only - 145. Binary Tree Postorder Traversal
- 700. Search in a Binary Search Tree
- 671. Second Minimum Node In a Binary Tree
- N-Arry Trees (Provide Both Iterative and Recursive Solution) 1. 589. N-ary Tree Preorder Traversal 1. 590. N-ary Tree Postorder Traversal
- 110. Balanced Binary Tree
- 637. Average of Levels in Binary Tree
- 501. Find Mode in Binary Search Tree
- 530. Minimum Absolute Difference in BST
- Diameter of Binary Tree - LeetCode
- 938. Range Sum of BST
- 226. Invert Binary Tree
- 617. Merge Two Binary Trees
- 993. Cousins in Binary Tree
- 108. Convert Sorted Array to Binary Search Tree
- 2236. Root Equals Sum of Children
- 572. Subtree of Another Tree
- 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- 897. Increasing Order Search Tree
- 965. Univalued Binary Tree
- 108. Convert Sorted Array to Binary Search Tree