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 () May 8, 2019 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 ()

May 8, 2019 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 ()