## Count of nodes which are at a distance X from root and leaves

Given two integers N and X, where N is the number of nodes in an almost complete binary tree. The task is to find: The… Read More »

- MakeMyTrip Interview Experience 2019
- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Flatten a binary tree into linked list | Set-3
- Zig-Zag traversal of a Binary Tree using Recursion
- Difference between graph and tree
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Clockwise Spiral Traversal of Binary Tree
- Shortest root to leaf path sum equal to a given number
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Reverse zigzag Traversal of a Binary Tree
- Iterative Boundary traversal of Complete Binary tree
- Number of subarrays have bitwise OR >= K
- Reverse Level Order traversal in spiral form
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- DP on Trees | Set-3 ( Diameter of N-ary Tree )
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Sum of all the Boundary Nodes of a Binary Tree
- Total number of possible Binary Search Trees using Catalan Number
- Determine the count of Leaf nodes in an N-ary tree
- Sum of nodes in bottom view of Binary Tree
- LCA in a tree using Binary Lifting Technique
- Find the node with maximum value in a Binary Search Tree using recursion
- Print all leaf nodes of a binary tree from right to left
- Distribute candies in a Binary Tree
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Adobe Interview Experience ( 3 Years Exp )

Given two integers N and X, where N is the number of nodes in an almost complete binary tree. The task is to find: The… Read More »

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

Given a Binary Search Tree, the task is to find the node with maximum value. Examples: Input: Output: 22 Recommended: Please try your approach on… Read More »

The Generic trees are the n-ary trees which have the following properties: Many children at every node. The number of nodes for each node is… Read More »

Given a Binary Search Tree, the task is to find the node with minimum value. Examples: Input: Output: 4 Recommended: Please try your approach on… Read More »

Given a permutation from 1 to N of size N. Find the length of the longest subsequence having the property that the first and last… Read More »

Given start and finish times of DFS traversal of N vertices that are available in a Rooted tree, the task is to construct the tree… Read More »

Given a Binary Tree, convert it to a Circular Doubly Linked List. The left and right pointers in nodes are to be used as previous… Read More »

Given a Binary Tree, find the density of it by doing one traversal of it. The density of binary tree is defined as: Density of… Read More »

Given a binary tree, the task is to print all the nodes except the leftmost in every level of the tree. The root is considered… Read More »

Given an integer L which is the sum of degrees of all the vertices of some tree. The task is to find the count of… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weighted string… Read More »

Given a Prufer sequence of N integers, the task is to check if the given sequence is a valid Prufer sequence or not. Examples: Input:… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights does… Read More »