YOUCADEMY

Depending on the reason for traversing a binary tree, we might require that the nodes be visited in a particular order with some relationship. For example, if we wish to traverse all the nodes in a binary search tree, we would like to visit all the nodes in ascending order of their values. So we need to use a specific tree traversal technique which visits all the nodes in ascending order of their values. Similarly, if we wish to delete every node in the tree, we should visit the child nodes first and delete them before deleting the parent node. And this requires another kind of tree traversal technique... The node has link to a right child node and another link to left child node . But if we look at the node , it has link to only left child node . Node doesn't link or point to any right child node. Any node in a binary tree which does not contain left and right children is known as a leaf node. In the example above, nodes , , do not have links to left or right childs and so they are..