Tree Problems

Tree problems test your ability to think recursively. From basic traversals (inorder, preorder, postorder) to more advanced operations like serialization, lowest common ancestor, and path sums.

48 problems

Title	Difficulty	Platform
All Nodes Distance K in Binary Tree	Medium	LeetCode
Balanced Binary Tree	Easy	LeetCode
Binary Search Tree Iterator	Medium	LeetCode
Binary Tree Cameras	Hard	LeetCode
Binary Tree Level Order Traversal	Medium	LeetCode
Binary Tree Maximum Path Sum	Hard	LeetCode
Binary Tree Paths	Easy	LeetCode
Binary Tree Right Side View	Medium	LeetCode
Binary Tree Zigzag Level Order Traversal	Medium	LeetCode
BST with Dead End \| Practice	Easy	GeeksforGeeks
Construct Binary Tree from Preorder and Postorder Traversal	Medium	LeetCode
Construct BST from Preorder Traversal	Hard	GeeksforGeeks
Convert Sorted Array to Binary Search Tree	Easy	LeetCode
Count BST nodes that lie in a given range \| Practice	Medium	GeeksforGeeks
Diameter of Binary Tree	Easy	LeetCode
Find median of BST	Hard	GeeksforGeeks
Flatten Binary Tree to Linked List	Medium	LeetCode
https://leetcode.com/problems/binary-tree-inorder-traversal/	Easy	LeetCode
https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1	Hard	GeeksforGeeks
Invert Binary Tree	Easy	LeetCode
Kth Smallest Element in a BST	Medium	LeetCode
Largest BST in a Binary Tree	Hard	GeeksforGeeks
Lowest Common Ancestor of a Binary Search Tree	Easy	LeetCode
Lowest Common Ancestor of a Binary Tree	Medium	LeetCode
Maximum Depth of Binary Tree	Easy	LeetCode
Maximum Width of Binary Tree	Medium	LeetCode
Merge Two Binary Trees	Easy	LeetCode
Min distance between two given nodes of a Binary Tree \| Practice	Medium	GeeksforGeeks
Minimum Absolute Difference in BST	Easy	LeetCode
Path Sum	Easy	LeetCode
Path Sum III	Medium	LeetCode
Populating Next Right Pointers in Each Node	Medium	LeetCode
Predecessor and Successor \| Practice	Easy	GeeksforGeeks
Preorder to BST \| Practice	Medium	GeeksforGeeks
Print all k-sum paths in a binary tree	Hard	GeeksforGeeks
Range Sum of BST	Easy	LeetCode
Recover Binary Search Tree	Medium	LeetCode
Redundant Connection	Medium	LeetCode
Same Tree	Easy	LeetCode
Serialize and Deserialize Binary Tree	Hard	LeetCode
Subtree of Another Tree	Easy	LeetCode
Sum of Distances in Tree	Hard	LeetCode
Sum of Left Leaves	Easy	LeetCode
Symmetric Tree	Easy	LeetCode
Unique Binary Search Trees	Medium	LeetCode
Unique Binary Search Trees II	Medium	LeetCode
Validate Binary Search Tree	Medium	LeetCode
Vertical Order Traversal of a Binary Tree	Hard	LeetCode