二叉树

最新推荐文章于 2022-05-01 12:47:37 发布

Garfield_cat_cat

最新推荐文章于 2022-05-01 12:47:37 发布

阅读量115

点赞数

分类专栏： java

本文链接：https://blog.csdn.net/u012620150/article/details/107774651

版权

java 专栏收录该内容

82 篇文章 1 订阅

订阅专栏

二叉树如下图所示：
在这里插入图片描述
列出它的前序，中序，后序
前序：根–>左–>右
41，20，11，29，32，65，50，91，72，99

中序: 左–>根–>右
11，20，29，32，41，50，65，72，91，99

后序: 左–>右–>根
11，32，29，20，50，72，99，91，65，41

代码实现方法如下:
1.定义TreeNode类

import lombok.Data;

@Data
public class TreeNode {
    private int val;
    private TreeNode left;
    private TreeNode right;

    public TreeNode(int val) {
        this.val = val;
        this.left = null;
        this.right = null;
    }
}

前序方法:

public static void previous(TreeNode treeNode){
        System.out.print(treeNode.getVal()+", ");
        if(treeNode.getLeft() != null){
            previous(treeNode.getLeft());
        }
        if(treeNode.getRight() != null){
            previous(treeNode.getRight());
        }
    }

3.中序方法:

public static void middle(TreeNode treeNode){

        if(treeNode.getLeft() != null){
            middle(treeNode.getLeft());
        }
        System.out.print(treeNode.getVal()+", ");
        if(treeNode.getRight() != null){
            middle(treeNode.getRight());
        }
    }

4.后序方法:

public static void after(TreeNode treeNode){
        if(treeNode.getLeft() != null){
            after(treeNode.getLeft());
        }
        if(treeNode.getRight() != null){
            after(treeNode.getRight());
        }
        System.out.print(treeNode.getVal()+", ");
    }

5.测试方法:

public static void main(String[] args) {
        TreeNode treeNodeRoot = new TreeNode(41);

        TreeNode treeNodeLeft = new TreeNode(20);
        TreeNode treeNodeLeft1 = new TreeNode(11);
        TreeNode treeNodeRight1 = new TreeNode(29);
        TreeNode treeNodeRight2 = new TreeNode(32);

        treeNodeRoot.setLeft(treeNodeLeft);
        treeNodeLeft.setLeft(treeNodeLeft1);
        treeNodeLeft.setRight(treeNodeRight1);
        treeNodeRight1.setRight(treeNodeRight2);

        TreeNode treeNodeRight = new TreeNode(65);
        TreeNode treeNodeLeft2 = new TreeNode(50);
        TreeNode treeNodeRight3 = new TreeNode(91);
        TreeNode treeNodeLeft3 = new TreeNode(72);
        TreeNode treeNodeRight4 = new TreeNode(99);

        treeNodeRoot.setRight(treeNodeRight);
        treeNodeRight.setLeft(treeNodeLeft2);
        treeNodeRight.setRight(treeNodeRight3);
        treeNodeRight3.setLeft(treeNodeLeft3);
        treeNodeRight3.setRight(treeNodeRight4);

        System.out.println("前序==================");
        previous(treeNodeRoot);
        System.out.println();
        System.out.println("中序==================");
        middle(treeNodeRoot);
        System.out.println();
        System.out.println("后序==================");
        after(treeNodeRoot);
    }