Determine whether a binary tree is a subtree of another binary tree
Given a binary tree, determine if it is a subtree of another binary tree or not. A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.
Category: Binary Tree
Combinations of words formed by replacing given numbers with corresponding alphabets
Given a set of positive numbers, find all possible combinations of words formed by replacing the continuous digits with the English alphabet’s corresponding character.
Check if a binary tree is a sum tree or not
Given a binary tree, check if it is a sum tree or not. In a sum tree, each non-leaf node’s value is equal to the sum of all elements present in its left and right subtree. The value of a leaf node can be anything.
In-place convert a binary tree to its sum tree
Given a binary tree, in-place convert it into its sum tree. Each node’s value is equal to the sum of all elements present in its left and right subtree in a sum tree. Consider the value of an empty node as 0.
Print cousins of a given node in a binary tree
Given a binary tree, print all cousins of a given node. Two nodes of a binary tree are cousins of each other only if they have different parents, but they have the same level.
Determine whether the given binary tree nodes are cousins of each other
Given a binary tree, determine if two given nodes are cousins of each other or not. Two nodes of a binary tree are cousins of each other only if they have different parents, but they have the same level.
Check if a binary tree is a complete binary tree or not
Given a binary tree, check if it is a complete binary tree or not. A complete binary tree is a binary tree in which every level, except possibly the last, is filled, and all nodes are as far left as possible.
Find the next node at the same level as the given node in a binary tree
Given a binary tree and a node in it, write an efficient algorithm to find its next node at the same level as the node.
Print top view of a binary tree
Given a binary tree, print the top view of it. Assume the left and right child of a node makes a 45–degree angle with the parent.
Print bottom view of a binary tree
Given a binary tree, print the bottom view of it. Assume the left and right child of a node makes a 45–degree angle with the parent.
Print left view of a binary tree
Given a binary tree, write an efficient algorithm to print its left view. For example, the left view of the following binary tree is 1, 2, 4, 7.
Print all nodes of a perfect binary tree in a specific order
Given a binary tree, write an efficient algorithm to print all nodes in a specific order. We need to print nodes of every level in alternating left and right.