Day14:二叉树递归迭代遍历 LeedCode:144.二叉树的前序遍历 145.二叉树的后序遍历 94.二叉树的中序遍历

魔法少女小严

已于 2024-06-04 15:03:36 修改

阅读量315

点赞数 5

文章标签：算法 java

于 2024-06-04 15:02:57 首次发布

本文链接：https://blog.csdn.net/2301_76352996/article/details/139435359

版权

144. 二叉树的前序遍历

给你二叉树的根节点 root ，返回它节点值的前序遍历。

示例 1：

输入：root = [1,null,2,3]
输出：[1,2,3]

示例 2：

输入：root = []
输出：[]

示例 3：

输入：root = [1]
输出：[1]

示例 4：

输入：root = [1,2]
输出：[1,2]

示例 5：

输入：root = [1,null,2]
输出：[1,2]

递归

/**
 * 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 {
    List<Integer> result = new LinkedList<>();
    public List<Integer> preorderTraversal(TreeNode root) {
           travel(root);
           return result;
    }
    public void travel(TreeNode root){
       if(root==null){
        return;
       }
       result.add(root.val);
        travel(root.left);
        travel(root.right);
       
   }
}

迭代

/**
 * 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 {
    Stack<TreeNode> stack = new Stack<>();
    List<Integer> result= new LinkedList<>();
    public List<Integer> preorderTraversal(TreeNode root) {
    TreeNode cur = root;
    if(cur == null) return result;
    stack.push(cur);
    while(stack.size()>0){
       TreeNode temp= stack.pop();
       result.add(temp.val);
       if(temp.right!=null){
        stack.add(temp.right);
       }
       if(temp.left!=null){
        stack.add(temp.left);
       }
    }
    return result;
    }
  
}

145. 二叉树的后序遍历

给你一棵二叉树的根节点 root ，返回其节点值的 后序遍历 。

示例 1：

输入：root = [1,null,2,3]
输出：[3,2,1]

示例 2：

输入：root = []
输出：[]

示例 3：

输入：root = [1]
输出：[1]

提示：

树中节点的数目在范围 [0, 100] 内
-100 <= Node.val <= 100

递归

/**
 * 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 {
    List<Integer> list =  new LinkedList<>();
    public List<Integer> postorderTraversal(TreeNode root) {
       travel(root);
         return list;
    }
    public void travel(TreeNode cur){
        if(cur == null)
        return;
        travel(cur.left);
        travel(cur.right);
        list.add(cur.val);
    }
}

迭代

/**
 * 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 List<Integer> postorderTraversal(TreeNode root) {
      //中右左
    Stack<TreeNode> stack = new Stack<>();
    List<Integer> result= new LinkedList<>();
    if(root == null){
        return result;
    }
          stack.push(root);
    while(stack.size()>0){
        TreeNode temp = stack.pop();
        result.add(temp.val);
        if(temp.left!=null){
            stack.push(temp.left);
        }
        if(temp.right!=null){
            stack.push(temp.right);
        }
    }
    //左右中
   Collections.reverse(result);
   return result;
    }
}

94. 二叉树的中序遍历

已解答

简单

相关企业

给定一个二叉树的根节点 root ，返回 它的中序遍历 。

示例 1：

输入：root = [1,null,2,3]
输出：[1,3,2]

示例 2：

输入：root = []
输出：[]

示例 3：

输入：root = [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 {
    List<Integer> list=new LinkedList<>();
    public List<Integer> inorderTraversal(TreeNode root) {
      travel(root);
      return list;
    }
    public void travel(TreeNode cur){
      if(cur == null)
      return;
      travel(cur.left);
      list.add(cur.val);
      travel(cur.right);
    }
}

迭代

思路:

先访问的是二叉树顶部的节点，然后一层一层向下访问，直到到达树左面的最底部，再开始处理节点（也就是在把节点的数值放进result数组中）

用栈来存储结点,指针记录当前遍历的位置,避免死循环

while(栈不为空&&cur!=null){

如果当前cur指针不为空

将cur入栈,cur=cur.left

如果指针为空

如果栈不为空,cur=栈顶元素,栈弹出一个元素,将该元素加入结果集

}

/**
 * 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 {
    List<Integer> result= new LinkedList<>();
    Stack<TreeNode> stack = new Stack<>();
    public List<Integer> inorderTraversal(TreeNode root) {
         TreeNode cur = root;
         while(cur!=null||stack.size()>0){
            if(cur!=null){
                stack.push(cur);
                cur=cur.left;
            }else{
                TreeNode temp = stack.pop();
                result.add(temp.val);
                cur=temp.right;
            }
         }
       return result;
    }
}