106. Construct Binary Tree from Inorder and Postorder Traversal

后序遍历和中序遍历得到二叉树本质和上一题没区别。只是后序遍历的根节点出现在最后面。将前一题的算法修改下即可

Previous105. Construct Binary Tree from Preorder and Inorder Traversal Next107. Binary Tree Level Order Traversal II

Last updated 5 years ago