If the inorder and the postorder traversal sequences of a binary

If the inorder and the postorder traversal sequences of a binary tree have exactly the opposite orders, then none of the nodes in the tree has a left subtree. ~@[](2)

答案：TRUE