Given the inorder traversal sequence and the postorder traversal sequence of a binary tree (with unique node ids), please write a program to return the level order traversal sequence of the binary tree (from left to right for nodes of the same level). For example, if inorder = [4, 2, 5, 1, 3, 6] and postorder = [4, 5, 2, 6, 3, 1], you should return [1, 2, 3, 4, 5, 6]. 1 2 3 4 5 6 Input: arrays of the inorder traversal sequence and postorder traversal sequence Output: an array of the level order traversal sequence