12,55,4,34,66,7,92,10,01,33,77,24,20 construct a binary search tree from the above sequence and perform inorder, pre order and post order traversal of the tree. also show algorithmic steps for it.
Answers
Answered by
0
Constructing a binary search tree from the above sequence and perform in-order, pre order and post order traversal of the tree and also showing algorithmic steps for it.
Step-by-step explanation:
binary search tree is shown in image by step by step
PRE-ORDER: 12 4 1 7 10 55 34 33 24 20 66 92 77
IN ORDER: 1 4 7 10 12 20 24 33 34 55 66 77 92
POST ORDER: 1 10 7 4 20 24 33 34 77 92 66 55 12
Attachments:
Similar questions