【剑指offer7】重建二叉树

重建二叉树

一.构造二叉树数

ps:粘贴代码的时候不要有太多的空行，不然会崩溃，尝试了很多次，哭了

public class TreeNode 
{
 private int valuel;//值
 private TreeNode leftTreeNode; //左节点
 private TreeNode rightTreeNode; //右节点
 public TreeNode(int val) 
 {
  this.valuel=val;
 }
 public int getValuel()
 {
  return valuel;
 }
 public void setValuel(int valuel) 
 {
  this.valuel = valuel;
 }
 public TreeNode getLeftTreeNode() 
 {
  return leftTreeNode;
 }
 public void setLeftTreeNode(TreeNode leftTreeNode)
 {
  this.leftTreeNode = leftTreeNode;
 }
 public TreeNode getRightTreeNode() 
 {
  return rightTreeNode;
 }
 public void setRightTreeNode(TreeNode rightTreeNode)
 {
  this.rightTreeNode = rightTreeNode;
 }
}

二.利用递归重建二叉树

我们先找到一个根，然后分开左右子树，然后找它的左子树和右子树。
重复这个循环我们会找到最下方的一个叶子结点，然后逐层向上构建这个树。

public TreeNode rebuildTree(int[] pre, int[] ino) 
 {

  //pre是前序遍历的节点顺序，ino是中序遍历节点的顺序
  if(pre==null||ino==null||pre.length==0||ino.length==0)
  {
   return null;
  }
  
  int Firstnode = pre[0];
  TreeNode tree = new TreeNode(Firstnode);
  int locaiton=0;
  for(int i=0;i<ino.length;i++)
  {
   if(Firstnode==ino[i])
   {
    locaiton=i;
   }
   
  }
  
  int leftnumber = locaiton;//左子树数量
  int rightnumber = ino.length-leftnumber-1;//右子树数量
  System.out.println(leftnumber);
  System.out.println(rightnumber);
  
  if(leftnumber>0)
  {
  
   int[] leftpre = new int[leftnumber];//前序遍历中的左子树
   int[] leftino = new int[leftnumber];//中序遍历中的左子树
   
   for(int i = 0;i<leftnumber;i++)
   {
    leftpre[i] = pre[i+1];
    leftino[i] = ino[i];
   }
   TreeNode leftNode = rebuildTree(leftpre, leftino);
   tree.setLeftTreeNode(leftNode);
    
  }
  if(rightnumber>0)
  {
   int[] rightpre = new int[rightnumber];//前序遍历中的右子树
   int[] rightino = new int[rightnumber];//中序遍历中的右子树
   for(int i=0;i<rightnumber;i++)
   {
    rightpre[i]= pre[leftnumber+1+i];
    rightino[i]= ino[leftnumber+1+i];
   }
   TreeNode rightNode = rebuildTree(rightpre, rightino);
   tree.setRightTreeNode(rightNode);
   
  }
  return tree;
 }

一开始可能不太好写，想通了就好了。和递归排序有点类似。

三.main函数调用与验证

public static void main(String[] args) {
 Test7 t7 = new Test7();
  int pre[] = {1,2,4,7,3,5,6,8};
  int ino[] = {4,7,2,1,5,3,8,6};
  TreeNode t = t7.rebuildTree(pre, ino);
  
  System.out.println("我是树------------------------------------------------------");
  System.out.println(t.getValuel());//1
  System.out.println(t.getLeftTreeNode().getValuel());//2
  System.out.println(t.getLeftTreeNode().getLeftTreeNode().getValuel());//4
  System.out.println(t.getLeftTreeNode().getLeftTreeNode().getRightTreeNode().getValuel());//7
  System.out.println(t.getRightTreeNode().getValuel());//3
  System.out.println(t.getRightTreeNode().getLeftTreeNode().getValuel());//5
  System.out.println(t.getRightTreeNode().getRightTreeNode().getValuel());//6
  System.out.println(t.getRightTreeNode().getRightTreeNode().getLeftTreeNode().getValuel());
 }

验证结果：
如果有不对的地方或者更好的方法恳请指正！