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… 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… Read More »