Author(s): P K Kumaresan
Depending on three different sequences of traversal of a binary tree, we get its preorder, postorder and inorder form. Similarly depending on preorder or postorder along with inorder, the binary tree can be formed. In this paper, we try to implement, through coding a binary tree is formed physically not virtually in computer memory and also give a realistic view of a binary tree, already created in computer memory. Using inorder and preorder traversal of binary tree and takes the value of the level of the tree we are able to graphically represent any binary tree. Keywords: Binary Tree, Inorder, Preorder, Link List, Structure Pointer, Recursive Function, Data Structure.