13) Postorder traversal of a given binary search tree is: 10, 3, 2, 5, 6, 4, 8, 11, 9, 15, 20, 19, 12, 7 The inorder traversal of the tree would be:

#1

how can the inorder traversal be unique?

#2

Note that it is a BST, so the inorder traversal is always the sorted array.