We have discussed Threaded Binary Tree. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion.
Given an N-ary tree where every node has at-most N children. How to serialize and deserialze it? Serialization is to store tree in a file so that it can be later restored.
Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained.
Given a binary tree and two level numbers ‘low’ and ‘high’, print nodes from level low to level high.
A given array represents a tree in such a way that the array value gives the parent node of that particular index. The value of the root node index would always be -1.
Given a very large n-ary tree. Where the root node has some information which it wants to pass to all of its children down to the leaves with the constraint that it can only pass the information to one of its children at a time (take it as one iteration).
Given the binary Tree and the two nodes say ‘a’ and ‘b’, determine whether the two nodes are cousins of each other or not.
Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T.
Given a binary tree in which each node element contains a number. Find the maximum possible sum from one leaf node to another.
Given a Perfect Binary Tree, reverse the alternate level nodes of the binary tree.
Given a binary tree, print it vertically. The following example illustrates vertical order traversal.