I am trying to find a binary tree which all of its keys are different but the three traversals inorder postorder inorder are the same so i thought of this tree:
1
—2
——3
———4
So basically there are no left sons But i am not sure if that would lead to similar three traversals
So is postorder=inorder=preorder = 1234 ?
