Snap SWE Interview Question 2024 April | Trees | on-campus

Question 1: Construct Binary Tree from Inorder and Postorder Traversal Problem Statement 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. Constraints 1 <= inorder.length <= 3000 postorder.length == inorder.length -3000 <= inorder[i], postorder[i] <= 3000 inorder and postorder consist of unique values. Each value of postorder also appears in inorder. inorder is guaranteed to be ...