Update every key in a BST to contain the sum of all greater keys
Given a binary search tree, modify it such that every key is updated to contain the sum of all greater keys present in the BST.
Category: Tree
Find the maximum difference between a node and its descendants in a binary tree
Given a binary tree, find the maximum difference between a node and its descendants in it.
Clone a Binary Tree
Given a binary tree, efficiently clone of it.
Print right view of a binary tree
Given a binary tree, write an efficient algorithm to print its right view. For example, the right view of a given binary tree is 1, 3, 6, 8.
Construct an ancestor matrix from a binary tree
Given a binary tree whose nodes are labeled from 0 to N-1, construct an N × N ancestor matrix. An ancestor matrix is a boolean matrix, whose cell (i, j) is true if i is an ancestor of j in the binary tree.
Construct a height-balanced BST from a sorted doubly linked list
Given a sorted doubly linked list, in-place convert it into a height-balanced Binary Search Tree (BST). The difference between the height of the left and right subtree for every node of a height-balanced BST is never greater than 1.
Find postorder traversal of a binary tree from its inorder and preorder sequence
Write an efficient algorithm to find postorder traversal on a given binary tree from its inorder and preorder sequence.
Remove nodes from a BST that have keys outside a valid range
Given a BST and a valid range of keys, remove nodes from BST that have keys outside the valid range.
Iteratively print the leaf to root path for every leaf node in a binary tree
Given a binary tree, write an iterative algorithm to print the leaf-to-root path for every leaf node. Use of recursion is prohibited.
Find a pair with the given sum in a BST
Given a binary search tree, find a pair with a given sum present in it.
Compute the maximum number of nodes at any level in a binary tree
Given a binary tree, write an efficient algorithm to compute the maximum number of nodes in any level in the binary tree.
Build a binary tree from a parent array
Given an array representing a binary tree, such that the parent-child relationship is defined by (A[i], i) for every index i in array A, build a binary tree out of it. The root node’s value is i if -1 is present at index i in the array.