We are given a binnary tree, we have to do inorder traversal and postorder traversal. Waht i have done is Inorder traversal 1, 2 ,3 ,4 ,5, 6, 7, 8,9 , 10, 11, 12, 13 ,14 , 18 Postorder traversal 1,2, 6, 7,9,8,5,11, 10,12, 4, 3, 13, 18,14 Please correct me. The BST is in the attachment.
Forum Rules