从中序与后序遍历序列构造二叉树[迭代]Day - 12

从中序与后序遍历序列构造二叉树[迭代]

给定两个整数数组 inorder 和 postorder ，其中 inorder 是二叉树的中序遍历， postorder 是同一棵树的后序遍历，请你构造并返回这颗 二叉树 。

示例 1:

输入：inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
输出：[3,9,20,null,null,15,7]

示例 2:

输入：inorder = [-1], postorder = [-1]
输出：[-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 {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if(postorder == null && postorder.length == 0){
            return null;
        }
        //定义一个队列，栈的方法队列都有
        Deque<TreeNode> stack = new LinkedList<TreeNode>();
        //因为是后序遍历，索引最后一个是头节点
        TreeNode root = new TreeNode(postorder[inorder.length - 1]);
        //添加头节点
        stack.push(root);
        //设置索引从后开始
        int startindex = inorder.length - 1;
        //循环遍历后序数组（从后到前）
        for(int i = postorder.length - 2; i >= 0; --i){
            //栈顶元素node节点
            TreeNode node = stack.peek();
            //循环元素值赋值
            int postorderVal = postorder[i];
            //如果栈顶元素不等于中序遍历的元素
            if(node.val != inorder[startindex]){
                //值变成新节点，添加到栈
                node.right = new TreeNode(postorderVal); 
                stack.push(node.right);
            }else{
                //
                while(!stack.isEmpty() && stack.peek().val == inorder[startindex]){
                    //弹出
                    node = stack.pop();
                    //索引减一
                    startindex--;
                }
                //不相等就是左节点
                node.left = new TreeNode(postorderVal);
                //添加到栈
                stack.push(node.left);
            }
        }
        return root;
    }
}