Given values of two nodes in a Binary Search Tree, write a c program to find the Lowest Common Ancestor (LCA). You may assume that both the values exist in the tree.
Asked by Varun Bhatia Here is the solution.
It depends on what traversals are given. If one of the traversal methods is Inorder then the tree can be constructed, otherwise not.
Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.
To delete a tree we must traverse all the nodes of the tree and delete them one by one. So which traversal we should use – Inorder or Preorder or Postorder. Answer is simple – Postorder, because before deleting the parent node we should delete its children nodes first We can delete tree with other… Read More »
Given a binary tree, find height of it. Height of empty tree is 0 and height of below tree is 3.
Two trees are identical when they have same data and arrangement of data is also same.
Size of a tree is the number of elements present in the tree. Size of the below tree is 5.
Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Following are the generally used ways for traversing trees.