Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.

Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Is there any way to implement a nonrecursive preorder traversal of a binary tree without using a stack? In a standalone function?<P>the recursive preorder looks like ...