Tree: Tree is non linear data structure. Rooted at one vertex. Tree contains no cycle. Elements are arranged in layers. A unique path travers from root to any node. Tree Traversals (Inorder, Preorder and Postorder) Unlikelinear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Following are the generally used ways for traversing trees. Depth First Traversals: (a) Inorder (Left, Root, Right) : 4 2 5 1 3 (b) Preorder (Root, Left, Right) : 1 2 4 5 3 (c) Postorder (Left, Right, Root) : 4 5 2 3 1 Inorder Traversal: Inorder (Left, Root, Right) : Algorithm Inorder(tree) 1. Traverse the left subtree. 2. Visit the root. 3. Traverse the right subtree. Uses of Inorder : In case of binary search trees (BST), Inorder traversal gives nodes in...