leetcode 106-从中序与后序遍历序列构造二叉树

三岁就很萌@D

已于 2022-10-02 10:52:58 修改

阅读量155

点赞数

分类专栏： leetcode 二叉树文章标签： leetcode 算法 c++

于 2019-12-28 11:24:43 首次发布

本文链接：https://blog.csdn.net/qq_44822951/article/details/103742670

版权

leetcode 同时被 2 个专栏收录

151 篇文章 1 订阅

订阅专栏

二叉树

4 篇文章 0 订阅

订阅专栏

在这里插入图片描述

struct TreeNode* build_Tree(int* postorder, int postorderSize, int* inorder, int inorderSize,int *root,int range1,int range2)
{
    if(*root<0)
       return NULL;
    if(range1>range2)
      return NULL;
    struct TreeNode* Root=(struct TreeNode*)malloc(sizeof(struct TreeNode));
    Root->val=postorder[*root];
    int i=0,index=0;
    for(i=range1;i<=range2;i++)
    {
        if(inorder[i]==postorder[*root])//找到根节点
        {
            index=i;
            break;
        }    
    }
    *root-=1;
    Root->right=build_Tree(postorder,postorderSize,inorder,inorderSize,root,index+1,range2);
    Root->left=build_Tree(postorder,postorderSize,inorder,inorderSize,root,range1,index-1);
    return Root;
}
struct TreeNode* buildTree(int* inorder, int inorderSize, int* postorder, int postorderSize){
      if(postorderSize==0)//如果是一棵空树
         return NULL;
      int root=postorderSize-1;
      return build_Tree(postorder,postorderSize,inorder,inorderSize,&root,0,inorderSize-1);
}

递归

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int postorderIndex = 0;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
         postorderIndex = inorder.length-1;
         return buildT(inorder,postorder,0,inorder.length-1);
    }
    public TreeNode buildT(int[] inorder,int[] postorder,int l,int r){
          if(l > r)
             return null;
          int rootIndex = 0;
          for(int i = l; i <= r; i++){
              if(inorder[i] == postorder[postorderIndex]){
                   rootIndex = i;
                   break;
              }
          }
          TreeNode root = new TreeNode(inorder[rootIndex]);
          postorderIndex -= 1;
          root.right = buildT(inorder,postorder,rootIndex+1,r);
          root.left = buildT(inorder,postorder,l,rootIndex-1);
          return root;
    }
}

迭代

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        int n = postorder.length;
        Stack<TreeNode> stack = new Stack<>();
        TreeNode root = new TreeNode(postorder[n-1]);
        stack.push(root);
        int inorderIndex = n-1;
        TreeNode node = null;
        for(int i = n-2; i >= 0; i--){
             if(!stack.isEmpty() && stack.peek().val != inorder[inorderIndex]){
                 node = stack.peek();
                 node.right = new TreeNode(postorder[i]);
                 stack.push(node.right);
             }else{
                 while(!stack.isEmpty() && stack.peek().val == inorder[inorderIndex]){
                      node = stack.pop();
                      inorderIndex -= 1;
                 }
                 node.left = new TreeNode(postorder[i]);
                 stack.push(node.left);
             }
        }
        return root;
    }
}