Calculate sum of root to leaf digits in a binary tree
Given a binary tree, where each node stores a value between 0 and 9, calculate the sum of the numbers created by the paths from root to leaf.
Category: Tree
Count paths with the given sum in a binary tree
Given a binary tree and an integer k, count the total number of paths in the tree whose sum of all nodes is equal to k.
Check children-sum property in a binary tree
Given the root of a binary tree, determine if the binary tree holds children-sum property. For a tree to satisfy the children-sum property, each node’s value should be equal to the sum of values at its left and right node.
Count nodes in a BST that lies within a given range
Given a BST, count the total number of nodes that lie within a given range.
Construct a complete binary tree from its linked list representation
Given a linked list, construct a complete binary tree from it. Assume that the order of elements present in the linked list is the same as that in the complete tree’s array representation.
Check if removing an edge can split a binary tree into two equal size trees
Given a binary tree, check if removing an edge can split it into two binary trees of equal size.
In-place merge two height-balanced BSTs
Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.
Find height of a binary tree represented by the parent array
Given an array representing the parent-child relationship in a binary tree, find the tree’s height without building it. The parent-child relationship is defined by (A[i], i) for every index i in array A.
Determine whether two nodes lie on the same path in a binary tree
Given a binary tree and two tree pointers, x and y, write an efficient algorithm to check if they lie on the same root-to-leaf path in the binary tree. In other words, determine whether x is an ancestor of y, or x is a descendant of y.
Determine whether a BST is skewed from its preorder traversal
Given an array representing the preorder traversal of a BST, determine whether it represents a skewed BST or not. In a skewed BST, each node’s descendants are either smaller or larger than the node itself.
Print all pairs of anagrams in a set of strings
Given a set of strings, print all pairs of anagrams together. Two strings, X and Y, are called anagrams if we can get a string Y by rearranging the letters of the string X and using all the characters of the string X exactly once.
Maximum Independent Set Problem
An independent set is a set of nodes in a binary tree, no two of which are adjacent. The maximum independent set problem is finding an independent set of the largest possible size for a given binary tree.