## Delete the last leaf node in a Binary Tree

Given a Binary Tree, the task is to find and DELETE the last leaf node. The leaf node is a node with no children. The… 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
- Check which player visits more number of Nodes
- Pair with a given sum in BST | Set 2
- 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
- Print Bottom-Right View of a Binary Tree
- Number of pairs with a given sum in a Binary Search 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
- Insertion in n-ary tree in given order and Level order traversal
- Cartesian tree from inorder traversal | Segment Tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Generic Trees(N-array Trees)
- Longest subsequence with first and last element greater than all other elements
- Check if the given n-ary tree is a binary tree

Given a Binary Tree, the task is to find and DELETE the last leaf node. The leaf node is a node with no children. The… Read More »

Given a binary tree, the task is to check whether the binary tree contains a duplicate sub-tree of size two or more. Input: A /… Read More »

Given a string str that contains a ternary expression which may be nested. The task is to convert the given ternary expression to a binary… Read More »

Given a tree with N nodes. Two players A and B start from node 1 and node N respectively. A can visit all the adjacent… Read More »

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 »