Tree Coding Problems for Interviews
Last Updated :
21 Sep, 2025
Improve
Here is the collection of the Top 50 list of frequently asked interview questions on Tree. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.
Easy Problems
- Height of Binary Tree
- Determine if two trees are identical
- Mirror tree
- Symmetric Tree
- Checked for Balanced tree
- Children Sum Parent
- Array to BST
- Nodes at given distance in a Binary Tree
- Inorder Successor in BST
- Kth Largest Element in a BST
- Balance a BST
Medium Problems
- Diameter of tree
- Check if subtree
- Check for BST
- Single Valued Subtree
- Unique BSTs
- Zigzag Tree Traversal
- Vertical Traversal of a Binary Tree
- Boundary Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct BST from preorder traversal
- Minimum distance between two nodes
- Maximum sum leaf to root path
- Odd Even Level Difference
- Lowest Common Ancestor of a Binary Tree
- Ancestors in Binary Tree
- Remove BST keys outside the given range
- Pair with given target in BST
- BST to greater sum tree
- Maximum sum of non adjacent nodes
- Largest BST in a Binary Tree
- Extreme nodes in alternate order
- Connect nodes at same level
Hard Problems
- Sorted Linked List to BST
- Binary Tree to Doubly Linked List
- Maximum sum path between two leaf nodes
- K-Sum Paths
- Number of turns in a binary tree
- Merge two BST’s
- Fixing two nodes of a BST
- Burn Binary Tree
- Clone binary tree with random pointer
Related Articles
- DSA Tutorial
- System Design Tutorial
- Array Coding Problems for Interviews
- String Coding Problems for Interviews
- Dynamic Programming Coding Problems for Interviews
- Graph Coding Problems for Interviews
- Sorting Coding Problems for Interviews
- Searching Coding Problems for Interviews
- Binary Search Tree Coding Problems for Interviews
TREE PRACTICE PROBLEMS | Tree Traversal Algorithms | DSA Course
Article Tags :
