## Insertion in n-ary tree in given order and Level order traversal

Given a set of parent nodes where the index of the array is the child of each Node value, the task is to insert the… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Kth smallest element in a subarray
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- 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 )
- LCA in a tree using Binary Lifting Technique
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Find the node with maximum value in a Binary Search Tree using recursion
- Sum of nodes in bottom view of Binary Tree
- Check if two nodes in a Binary Tree are siblings
- Print all leaf nodes of a binary tree from right to left
- Create a mirror tree from the given binary tree
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- K-th ancestor of a node in Binary Tree | Set 3
- Lazy Propagation in Segment Tree | Set 2
- Print path from root to all nodes in a Complete Binary Tree
- Sum of nodes in top view of binary tree
- Pair with a given sum in BST | Set 2
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Find the node with minimum value in a Binary Search Tree using recursion
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Minimum steps to color the tree with given colors
- Construct BST from its given level order traversal | Set-2
- Minimum sum path between two leaves of a binary tree
- Sum of the distances from every node to all other nodes is maximum
- Number of pairs with a given sum in a Binary Search Tree

Given a set of parent nodes where the index of the array is the child of each Node value, the task is to insert the… Read More »

In Bottom-Up insertion of Red-Black Trees, “simple” Binary Search Tree insertion is used, followed by correction of the RB-Tree Violations on the way back up… Read More »

The m-way search trees are multi-way trees which are generalised versions of binary trees where each node contains multiple elements. In an m-Way tree of… Read More »

Given an array of values. The task is to implement a Binary Search Tree using values of the array where every node stores the maximum… Read More »

Given two trees each of N nodes. Removing an edge of the tree partitions the tree in two subsets. Find the total maximum number of… Read More »

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

Given an array arr[] of N integers and Q queries. Each query can be represented by two integers L and R. The task is to… Read More »

Given a tree with N distinct nodes from the range [1, n] and two integers x and val. The task is to find the maximum… Read More »

Given a tree with N vertices and N-1 Edges. Let’s define a function F(a, b) which is equal to the minimum edge weight in the… Read More »

Given a Binary Tree, print Bottom-Right view of it. The Bottom Right view of a Binary Tree is a set of nodes visible when the… Read More »

Given a binary tree. The task is to find the value of the deepest node in the given binary tree. Examples: Input: Root of below… Read More »

Given a binary tree and an integer k. The task is to count the number of paths in the tree with the sum of the… Read More »

B*-tree of order m is a search tree that is either empty or that satisfies three properties: The root node has minimum two and maximum… Read More »

Given an array arr of size N. The task is to find the kth smallest element in the subarray(l to r, both inclusive). Note :… Read More »

Given a Binary Search Tree (BST), the task is to print the BST in min-max fashion. What is min-max fashion? A min-max fashion means you… Read More »