Page 240 - DCAP407_DATA_STRUCTURE
P. 240

Unit 12:  Binary Tree Traversals and Operations





               3.   Perform an inorder traversal for the given binary tree.


















               4.   Perform a postorder traversal for the given binary tree.


















               5.   For the following algebraic expression, construct a binary tree.
                       (T1+T2) + T3 – (T5 * T6)
               Answers: Self Assessment
               1.   (a) False        (b) False

               2.   (a) Parent       (b) Traversing   (c) Index
               3.   (a) Preorder     (b) Postorder   (c) Inorder   (d) Searching





























                                        LOVELY PROFESSIONAL UNIVERSITY                          233
   235   236   237   238   239   240   241   242   243   244   245