已知前序遍歷和中序遍歷,可以構造唯一二叉樹
同樣,已知後序和中序遍歷,可以構造唯一二叉樹
但是已知前序和後序,並不能構造唯一二叉樹,因爲對於單個子節點無法確定到底是左子樹還是右子樹
已知前序中序 Leetcode
public TreeNode buildTree(int[] preorder, int[] inorder) {
return buildTree(preorder, 0, preorder.length, inorder, 0, inorder.length);
}
private TreeNode buildTree(int[] preorder, int preStart, int preEnd, int[] inorder, int inStart, int inEnd) {
if(preorder == null || preEnd==preStart) return null;
int v = preorder[preStart];
TreeNode root = new TreeNode(v);
int index = inStart;
while (inorder[index]!=v) ++index;
int leftCount = index - inStart;
root.left = buildTree(preorder, preStart+1, preStart+1+leftCount, inorder, inStart, index);
root.right = buildTree(preorder,preStart+1+leftCount, preEnd, inorder, index+1, inEnd);
return root;
}
已知後序中序 Leetcode
public TreeNode buildTree(int[] inorder, int[] postorder) {
return buildTree(inorder, 0, inorder.length, postorder, 0, postorder.length);
}
privateTreeNode buildTree(int[] inorder, int inStart, int inEnd, int[] postorder, int postStart, int postEnd) {
if(postorder == null || postStart==postEnd) return null;
int v = postorder[postEnd-1];
TreeNode root = new TreeNode(v);
int index = inStart;
while (inorder[index]!=v) ++index;
int leftCount = index - inStart;
root.left = buildTree(inorder, inStart, index, postorder, postStart, postStart+leftCount);
root.right = buildTree(inorder,index+1, inEnd, postorder, postStart+leftCount, postEnd-1);
return root;
}