给出一棵树的中序遍历和后序遍历，请构造这颗二叉树 注意： 保证给出的树中不存在重复的节点
示例1
输入
[2,1,3],[2,3,1]
输出
{1,2,3}
加载中...
import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * } */ public class Solution { /** * * @param inorder int整型一维数组 * @param postorder int整型一维数组 * @return TreeNode类 */ public TreeNode buildTree (int[] inorder, int[] postorder) { // write code here } }
/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * * @param inorder int整型vector * @param postorder int整型vector * @return TreeNode类 */ TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) { // write code here } };
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param inorder int整型一维数组 # @param postorder int整型一维数组 # @return TreeNode类 # class Solution: def buildTree(self , inorder , postorder ): # write code here
/* * function TreeNode(x) { * this.val = x; * this.left = null; * this.right = null; * } */ /** * * @param inorder int整型一维数组 * @param postorder int整型一维数组 * @return TreeNode类 */ function buildTree( inorder , postorder ) { // write code here } module.exports = { buildTree : buildTree };
# class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None # # # @param inorder int整型一维数组 # @param postorder int整型一维数组 # @return TreeNode类 # class Solution: def buildTree(self , inorder , postorder ): # write code here
package main import . "nc_tools" /* * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ /** * * @param inorder int整型一维数组 * @param postorder int整型一维数组 * @return TreeNode类 */ func buildTree( inorder []int , postorder []int ) *TreeNode { // write code here }
[2,1,3],[2,3,1]
{1,2,3}