问题描述:
Given preorder and inorder traversal of a tree, construct the binary tree.
分析:这道题实际上是考察如何从前序遍历和中序遍历中构造树。思想是:对于前序遍历而言,第一个元素一定为根节点。而对于中序遍历,根节点左边的都为左侧节点,根节点右边的都为右侧节点(找到了左侧长度和右侧长度)。然后前序遍历中,顺序依次为root,左侧节点和右侧节点。
此时,已经找打了一个树的root,左子树部分的前序遍历、左子树的中序遍历,右子树的前序遍历和右子树的中序遍历。利用递归,构造成一棵生成树。
代码如下:388ms
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
if(preorder.length==0)
return null;
int rootVal = preorder[0];
int point;
for(point = 0;point<inorder.length;point++){
if(inorder[point]==rootVal)
break;
}
TreeNode root = new TreeNode(rootVal);
int[] leftPreOrder = Arrays.copyOfRange(preorder,1,point+1);
int[] leftInOrder = Arrays.copyOfRange(inorder,0,point);
int[] rightPreOrder = Arrays.copyOfRange(preorder,point+1,preorder.length);
int[] rightInOrder = Arrays.copyOfRange(inorder,point+1,inorder.length);
root.left = buildTree(leftPreOrder,leftInOrder);
root.right = buildTree(rightPreOrder,rightInOrder);
return root;
}
}