Traversing Binary Tree

Traversing Binary Tree: There are three standard ways of traversing a binary tree T with root R. These three algorithms, called preorder, inorder and postorder.

Preorder:

             
                (1)      Process the root R.

          (2)   Traverse the left subtree of R in preorder.

          (3)   Traverse the right subtree of R in preorder

Inorder:

             
                 (1)       Traverse the left subtree of R in inorder.

           (2)   Process the root R.

           (3)    Traverse the right subtree of R in inorder

Postorder:

             
                (1)        Traverse the left subtree of R in postorder.

           (2)   Traverse the right subtree of R in postorder.

           (3)   Process the root R.

           

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE