Question

Create a binary search tree with the following data (insert them in the order in which it is indicated

data: 15, 3, 9, 2, 5, 38, 14, 96, 7, 26, 56, 76, 23

Once you finish with the insertions, return it to Inorder, Preorder and Postorder.

Answer 1

data: 15, 3, 4, 2,5, 38, 14, 76, 7,26, S6, 76,23 Step 1: Insert 15 Stepe Insert 96 Step? : Insert 3 Step3 : Inseot 9 Step 4 a Step 9 Insert 7,26 Insert a 15 steps: Insert 5 Steps: Insert 38 Step 10 Insert 56, 76,23 The final Tree is Step 7 : Insert 14

1) In Order (Left, Root Right) 2,3,5,7,9, 14, 15, 23, 26, 38,56, 76,96 The left sub Tree is visited first, than the rout and later the Right SubTree. The Output will be in Ascending Order 2) Pre Order C Root, left, right) 15,3,2,1,5,7,14,38,26,23,96, S6,76 we start from IS (Root node) and then move to its left subtree B.B is also traversed Preorder. The process goes on. 3) Post Order Cleft , Root Right, Root) 2, 7,5, 14,4,3,23,26, 76, S6, 96, 38, IS first we traverse the left subtree, then the Right subtree and finally the Root hode.

Answer 2

9,6,8,4,2,7,1,3,5