If the postorder and inorder traversal sequences of a binary tre

If the postorder and inorder traversal sequences of a binary tree are the same, then none of the nodes in the tree has a left child. ~@[](2)

答案：FALSE