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

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

?

ref:?http://fisherlei.blogspot.com/2013/01/leetcode-construct-binary-tree-from.html

注意 preorder根節(jié)點(diǎn)的下標(biāo)是 pStart, 不要寫(xiě)成 0

?注意 preorder 注意左子樹(shù)和右子樹(shù)開(kāi)始的index

左子樹(shù)是 pStart+1 + (rootIndex-1 - iStart) // inorder中 左子樹(shù)的長(zhǎng)度

右子樹(shù)是?pStart+1 + (rootIndex-1 - iStart) +1

?

/*** 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) {if (preorder == null || inorder == null) {return null;}int preLen = preorder.length;int inLen = inorder.length;if (preLen == 0 || inLen == 0) {return null;}return constructTree(preorder, 0, preLen - 1, inorder, 0, inLen - 1);}public static TreeNode constructTree(int[] preorder, int preStart, int preEnd,int[] inorder, int inStart, int inEnd) {int rootValue = preorder[preStart];TreeNode root = new TreeNode(rootValue);root.left = null;root.right = null;if (preStart == preEnd && preorder[preStart] == inorder[inStart]) {return root;}int i = inStart;for (; i <= inEnd; i++) {if (rootValue == inorder[i]) {break;}}int leftLen = i - inStart;// 如果左子樹(shù)不為空if (leftLen > 0) {root.left = constructTree(preorder, preStart + 1, preStart+ leftLen, inorder, inStart, i - 1);}// 如果右子樹(shù)不為空if (inEnd > i) {root.right = constructTree(preorder, preStart + leftLen + 1,preEnd, inorder, i + 1, inEnd);}return root;}}

?

轉(zhuǎn)載于:https://www.cnblogs.com/RazerLu/p/3545284.html

總結(jié)

以上是生活随笔為你收集整理的Construct Binary Tree from Preorder and Inorder Traversal的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。