Given a binary tree whose Inorder and Preorder traversals are respectively 4, 2, 5, 1 3, 6, 7 and 1, 2, 4, 5, 6, 3, 7, print its Postorder traversal Draw the Binary Search Tree resulting from the successive insertions of the following integers 8, 89, 6, 32, 66, 21, 95, 1, 4