（複選）Considering the following two sequences, which are traversal results of a binary tree.

• Inorder-traversal result: H D I N B E J A O K P F L C G M
• Postorder-traversal result: H N I D J E B O P K L F M G C A

Please reconstruct the binary tree using the above two sequences. Which of the following descriptions are correct for the resultant binary tree?

Note: In a tree, each step from top to bottom is called the level of a tree. The level count starts with 1 and increments by 1 at each level or step.