If the preorder traversal of a binary tree is a,e,b,d,c, and the postorder traversal is b,c,d,e,a, then the child node of the root node ()

  c++, question

If the preorder traversal of a binary tree is a,e,b,d,c, and the postorder traversal is b,c,d,e,a, then the child node of the root node ()

图片描述