定义的树节点如下,
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
前序中序
原理:
前序遍历序列特征:[根节点, 左子树, 右子树]
中序遍历序列特征:[左子树, 根节点, 右子树]
先构造根节点,即前序遍历序列的第一个元素,然后在中序序列里找到根节点,以此为界拆分,递归分别构造其左子树和右子树
代码实现如下,
public TreeNode buildTree(int[] preorder, int[] inorder) {
return help(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
}
public TreeNode help(int[] pre, int[] inner, int ps, int pe, int is, int ie) {
if (ps > pe || is > ie) return null;
TreeNode root = new TreeNode(pre[ps]);
int i = is;
for (;i <= ie; i++) if (pre[ps] == inner[i]) break;
root.left = help(pre, inner, ps + 1, ps + i - is, is, i - 1);
root.right = help(pre, inner, ps + i - is + 1, pe, i + 1, ie);
return root;
}
中序后序
原理:
中序遍历序列特征:[左子树, 根节点, 右子树]
后序遍历序列特征:[左子树, 右子树, 根节点]
先构造根节点,即后序遍历序列的最后一个元素,在中序遍历序列里找到根节点,以此为界,再递归分别构造其左子树和右子树
代码实现如下,
public TreeNode buildTree(int[] inorder, int[] postorder) {
return help(inorder, postorder, 0 , inorder.length - 1, 0, postorder.length - 1);
}
public TreeNode help(int[] inner, int[] post,int is, int ie, int ps, int pe) {
if (ps > pe || is > ie) return null;
TreeNode root = new TreeNode(post[pe]);
int i = is;
for (;i <= ie; i++) if (inner[i] == post[pe]) break;
root.left = help(inner, post, is,i - 1, ps,ps + i - is - 1);
root.right = help(inner, post,i + 1, ie, ps + i - is, pe - 1);
return root;
}
前序后序
原理:
前序遍历序列特征:[根节点, 左子树, 右子树]
后序遍历序列特征:[左子树, 右子树, 根节点]
通过前序后序来构造二叉树,只有每个节点都满足要么没有子节点,要么有两个子节点这一条件才能唯一确认一颗树。不满足也没关系,不妨碍我们构造二叉树
先构造根节点,即前序遍历序列的第一个元素,然后以其左子树的根节点作为分界点,进行划分,递归构造其左子树和右子树
代码实现如下,
public TreeNode constructFromPrePost(int[] preorder, int[] postorder) {
return help(preorder, postorder, 0, preorder.length - 1, 0 , postorder.length - 1);
}
public TreeNode help(int[] pre, int[] post,int is, int ie, int ps, int pe) {
if (ps > pe || is > ie) return null;
TreeNode root = new TreeNode(pre[is]);
if (is == ie) return root;
int i = 0;
for (;pre[is + 1] != post[i]; i++);
root.left = help(pre, post, is + 1,is + i - ps + 1, ps,i);
root.right = help(pre, post,is + i - ps + 2, ie, i + 1, pe - 1);
return root;
}