java实现树的先序、中序、后序、层序遍历（递归、迭代版本）

最新推荐文章于 2024-07-10 21:37:49 发布

lk_bupt

最新推荐文章于 2024-07-10 21:37:49 发布

阅读量752

点赞数 1

文章标签： java 深度优先 leetcode

本文链接：https://blog.csdn.net/weixin_40572650/article/details/122024931

版权

一、树的定义（类）

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;
 *     }
 * }
 */

2.N叉树

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

二、先序遍历（根左右）

1.二叉树

//递归
class Solution {
   
    public List<Integer> preorderTraversal(TreeNode root) {
   
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        dfs(root, res);
        return res;
    }
    public void dfs(TreeNode root, List<Integer> list){
   
        if(root == null) return;
        list.add(root.val);
        dfs(root.left, list);
        dfs(root.right, list);
    }
}

 //迭代
class Solution {
   
    public List<Integer> preorderTraversal(TreeNode root) {
   
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        Stack<TreeNode> st = new Stack<>();
        st.push(root);
        while(!st.empty()){
   
            TreeNode node = st.pop();
            res.add(node.val);
            //注意后进先出，先放入右子树，后左子树
            if(node.right != null) st.add(node.right);
            if(node.left != null) st.add(node.left);
        }
        return res;
    }
}

2.N叉树

//递归
class Solution {
   
    public List<Integer> preorder(Node root) {
   
        List<Integer> res = new ArrayList<>();
        if(root == null) return res;
        dfs(root, res);
        return res;
    }
    public void dfs(Node root, List<Integer> list){
   
        if(root