1.中序遍历和后序遍历树构造二叉树
根据中序遍历和后序遍历树构造二叉树
样例
给出树的中序遍历: [1,2,3] 和后序遍历: [1,3,2]
返回如下的树:
2
/ \
1 3
/**
* 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[] inorder, int[] postorder) {
if(inorder.length==0&&postorder.length==0)
return null;
TreeNode root=new TreeNode(postorder[postorder.length-1]);
int leftNums=0;//左子树节点个数
int rightNums=0;//右子树节点个数
for(int i=0;i<inorder.length;i++){
if(inorder[i]==root.val)
break;
else
leftNums++;
}
rightNums=inorder.length-leftNums-1;
if(leftNums>0){
int[] inorderLeft=Arrays.copyOfRange(inorder, 0, leftNums);
int[] postorderLeft=Arrays.copyOfRange(postorder,0,leftNums);
TreeNode left=buildTree(inorderLeft,postorderLeft);
root.left=left;
}
if(rightNums>0){
int[] inorderRight=Arrays.copyOfRange(inorder, leftNums+1, inorder.length);
int[] postorderRight=Arrays.copyOfRange(postorder, leftNums, inorder.length-1);
TreeNode right=buildTree(inorderRight,postorderRight);
root.right=right;
}
return root;
}
}
2.前序遍历和中序遍历树构造二叉树
根据前序遍历和中序遍历树构造二叉树.
样例
给出中序遍历:[1,2,3]
和前序遍历:[2,1,3]
. 返回如下的树:
2
/ \
1 3
/**
* 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&&inorder.length==0)
return null;
TreeNode root=new TreeNode(preorder[0]);
int leftNums=0;//记录左子树的节点个数
for(int i=0;i<inorder.length;i++){
if(inorder[i]!=root.val)
leftNums++;
else
break;
}
int rightNums=inorder.length-1-leftNums;
if(leftNums>0){
int[] preorderLeft=Arrays.copyOfRange(preorder, 1, leftNums+1);
int[] inorderLeft=Arrays.copyOfRange(inorder, 0,leftNums);
TreeNode left=buildTree(preorderLeft,inorderLeft);
root.left=left;
}
if(rightNums>0){
int[] preorderRight=Arrays.copyOfRange(preorder, leftNums+1, preorder.length);
int[] inorderRight=Arrays.copyOfRange(inorder, leftNums+1, inorder.length);
/*for(int i=0;i<rightNums;i++){
inorderRight[i]=inorder[leftNums+i+1];
preorderRight[i]=preorder[leftNums+i+1];
}*/
TreeNode right=buildTree(preorderRight,inorderRight);
root.right=right;
}
return root;
}
}
3.把排序数组转换为高度最小的二叉搜索树
给一个排序数组(从小到大),将其转换为一棵高度最小的排序二叉树。
样例
给出数组 [1,2,3,4,5,6,7]
, 返回
4
/ \
2 6
/ \ / \
1 3 5 7
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param A: an integer array
* @return: a tree node
*/
public TreeNode sortedArrayToBST(int[] A) {
if(A==null||A.length==0){
return null;
}
int length=A.length;
int val=A[(length-1)/2];
int[] left=new int[(length-1)/2];
for(int i=0;i<(length-1)/2;i++){
left[i]=A[i];
}
int[] right=new int[length/2];
int index=0;
for(int i=(length+1)/2;i<length;i++){
right[index++]=A[i];
}
TreeNode root=new TreeNode(val);
root.left=sortedArrayToBST(left);
root.right=sortedArrayToBST(right);
return root;
}
}