## Construct the Rooted tree by using start and finish time of its DFS traversal

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 »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Kth smallest element in a subarray
- Introduction to Data Structures | 10 most commonly used Data Structures
- Iterative Postorder traversal | Set 3
- Total number of possible Binary Search Trees using Catalan Number
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Adobe Interview Experience ( 3 Years Exp )
- Find the node with maximum value in a Binary Search Tree using recursion
- Burn the binary tree starting from the target node
- K-th ancestor of a node in Binary Tree | Set 3
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Pair with a given sum in BST | Set 2
- Check which player visits more number of Nodes
- Find the node with minimum value in a Binary Search Tree using recursion
- Construct BST from its given level order traversal | Set-2
- Minimum steps to color the tree with given colors
- Number of pairs with a given sum in a Binary Search Tree
- Print Bottom-Right View of a Binary Tree
- Sum of the distances from every node to all other nodes is maximum
- Queries for number of distinct elements in a subarray | Set 2
- Print Binary Search Tree in Min Max Fashion
- Find the largest Complete Subtree in a given Binary Tree
- Count all k-sum paths in a Binary Tree
- Reverse tree path using Queue
- Cartesian tree from inorder traversal | Segment Tree
- Insertion in n-ary tree in given order and Level order traversal
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Generic Trees(N-array Trees)
- Queries to update a given index and find gcd in range
- Longest subsequence with first and last element greater than all other elements

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 tree with N nodes and a number K. Paint every node of the tree in one of the K available colors. Count and… 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 »

Given a Prufer sequence, the task is to find the degrees of all the nodes of the tree made by the prufer sequence. Examples: Input:… Read More »

Given a Prufer sequence of a Tree, the task is to print the node with the maximum degree in the tree whose Prufer sequence is… Read More »

Given a tree, and the weights of all the nodes, the task is to count the nodes whose weights are divisible by x. 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 are… 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 contain… Read More »