BA202 : BINARY SEARCH TREE

There are three standard ways of traversing a binary tree T with Root R. These three algorithms, called Pre-order , Inorder and post order. Below is the example of those algorithm: