Reconstruct a Binary Tree from Inorder Traversal (Follow-up)

You receive a binary tree's inorder traversal and need to recreate the tree. Notes An inorder ordering by itself generally cannot identify one unique original binary tree. Discussion points Describe why an inorder traversal alone does not provide enough information to recover a binary tree uniquely. Name extra traversal data that would allow reconstruction, such as preorder or postorder. When that extra data is available (for example, inorder together with preorder), explain…