LeetCode 105 Construct Binary Tree from Preorder and Inorder Traversal

来源:互联网 发布:js字符串时间格式化 编辑:程序博客网 时间:2024/05/17 11:37

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:

You may assume that duplicates do not exist in the tree.

思路:递归

/** * Definition for binary tree * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {public TreeNode buildTree(int[] preorder, int[] inorder) {return buildTree(preorder, 0,preorder.length-1,inorder,0,inorder.length-1);}public TreeNode buildTree(int[] preorder, int s1,int e1,int[] inorder,int s2,int e2) {if(s1<=e1&&s2<=e2){TreeNode temp=new TreeNode(preorder[s1]);int i=s2;for(;i<=e2&&inorder[i]!=preorder[s1];i++);temp.left=buildTree(preorder,s1+1,s1+i-s2,inorder,s2,i-1);temp.right=buildTree(preorder,s1+i-s2+1,e1,inorder,i+1,e2);return temp;}else return null;}}


0 0
原创粉丝点击