Dynamic Programming
Trees
Arrays
Strings
Linked List
Graph
Search
Home
Trees Interview Questions
What's new @IDeserve?
Popular Uploads
Subscribe to IDeserve Youtube Channel
List of problems sorted in increasing order of difficulty:
Pre-order Traversal of a Binary Tree
Post-order Traversal of a Binary Tree
In-order Traversal of a Binary Tree
Binary Tree Level Order Traversal
Print right view of a binary tree
Print all nodes of a binary tree that do not have sibling
Print all Root to Leaf paths of a Binary Tree
Minimum Depth of a Binary Tree
Print left view of a binary tree
Find sum of all left leaves of a binary tree
Find depth of deepest odd level leaf node
Check whether a binary tree is a full binary tree or not
Check whether a binary tree is complete or not
Check if two nodes are cousins in a Binary tree
Check if two binary trees are identical
Check if all internal nodes of BST have only one child without building tree
Convert the given n-ary tree to its mirror image
Convert a binary tree to its mirror tree
Print top view of a binary tree
Print top view of a binary tree using level order traversal
Print bottom view of a binary tree
Print bottom view of a binary tree using level order traversal
Remove the nodes of binary search tree which are outside the given range
Remove all nodes which lie on path having sum less than k
Remove all the half nodes from a given binary tree
Print binary tree in vertical order
Populate right neighbors for all nodes in a binary tree
Lowest Common Ancestor of two nodes in a Binary Search Tree
Iterative Pre-order Traversal of a Binary Tree
In-order Successor of a Node in a Binary Tree
Recover a Binary Search Tree if positions of two nodes are swapped.
Find floor and ceiling of an element from given dataset using binary search tree
Diagonal Sum of a Binary Tree.
Create a balanced Binary Search Tree from a sorted array
Convert a sorted Doubly Linked List to Balanced Binary Search Tree
Convert a binary tree to doubly linked list
Check if a binary tree is balanced or not
Check if a binary tree is a binary search tree
Check if two binary search trees are identical given their array representations | Set 2
Check if two binary search trees are identical given their array representations
Check if a binary tree is sub-tree of another binary tree in time O(n)
Check if a binary tree is sub-tree of another binary tree in space O(1)
Binary Search tree | Insertion and Search
Binary Search tree | Deletion
Check if a given binary tree is symmetric tree or not
Check if the given n-ary tree is symmetric tree or not
Spiral Level Order Traversal of a Binary Tree | Set 1
Spiral Level Order Traversal of a Binary Tree | Set 2
Find maximum element from each sub-array of size 'k'| Set 1
Total number of possible Binary Search Trees with 'n' keys
Find the size of largest BST in a binary tree
Lowest Common Ancestor of 2 nodes in a Binary Tree
Find height of the binary tree from its parent array representation
Convert binary tree to binary search tree
Construct the binary tree from its parent array representation
Construct binary tree from inorder and preorder traversals
Construct binary tree from inorder and postorder traversals
AVL tree | Basics
AVL tree | Insertion
AVL tree | Deletion
Trie Data Structure | Insert and search
Trie Data Structure | Delete
Pattern matching using Trie
Longest Prefix Matching using Trie
Given a sequence of words, group together all anagrams and print them.
Serialize and Deserialize a binary search tree
Serialize and Deserialize a binary search tree using post order traversal
Like IDeserve?
Support us by whitelisting IDeserve in your ad-blocker.
Thanks,
-Team IDeserve
Like IDeserve?
Support us by whitelisting IDeserve in your ad-blocker.
Thanks,
-Team IDeserve