The preorder traversal of a binary tree is A B D E C F and its inorder traversal is D B E A F C. What is its postorder traversal?

Explanation

A is the root; B (with children D and E) forms the left subtree and C (with left child F) the right subtree, so the postorder is D E B F C A.