二叉树遍历(递归、BFS、DFS)

最新推荐文章于 2024-08-05 11:11:16 发布

mudamu88

最新推荐文章于 2024-08-05 11:11:16 发布

阅读量655

点赞数

分类专栏： Java 笔试

本文链接：https://blog.csdn.net/linyixiao88/article/details/82431010

版权

Java 同时被 2 个专栏收录

58 篇文章 0 订阅

订阅专栏

笔试

4 篇文章 0 订阅

订阅专栏

import java.util.LinkedList;
import java.util.Queue;
//          0
//        /  \
//        1   2
//       / \
//      3  4

public class maxDepth{
    public static void main(String[] args){
        TreeNode node0 = new TreeNode(0);
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        node0.left = node1;
        node0.right = node2;
        node1.left = node3;
        node1.right = node4;
        theFirstTraversal(node0);
        //theInOrderTraversal(node0);
        //thePostOrderTraversal(node0);
    }

    //前序遍历递归
    public static void theFirstTraversal(TreeNode root) {
        System.out.println(root.val);
        if (root.left != null) {
            theInOrderTraversal(root.left);
        }
        if (root.right != null) {
            theInOrderTraversal(root.right);
        }
    }
    //中序遍历递归
    public static void theInOrderTraversal(TreeNode root) {
        if (root.left != null) {
            theInOrderTraversal(root.left);
        }
        System.out.println(root.val);
        if (root.right != null) {
            theInOrderTraversal(root.right);
        }
    }
    //后序遍历递归
    public static void thePostOrderTraversal(TreeNode root) {
        if (root.left != null) {
            theInOrderTraversal(root.left);
        }
        if (root.right != null) {
            theInOrderTraversal(root.right);
        }
        System.out.println(root.val);
    }
}


class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }
}