栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > Java

Java实现二叉树

Java 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

Java实现二叉树

定义树结点

class TreeNode {
    int val;		//当前结点的值
    TreeNode left;	//左子结点
    TreeNode right; //右子结点
    //无参构造
    public TreeNode() {
        val = 0;
    }
    //有参构造方法
    public TreeNode(int val) {
        this.val = val;
    }

    @Override
    public String toString() {
        return "TreeNode{" +
                "val=" + val +
                ", left=" + left +
                ", right=" + right +
                '}';
    }
	//前序递归
    public void preOrder() {
        System.out.println(this.val);
        if (this.left != null) {
            this.left.preOrder();
        }
        if (this.right != null) {
            this.right.preOrder();
        }
    }
}

定义二叉树

class BinaryTree {
    TreeNode root;	//根结点
    //构造器
    public BinaryTree(TreeNode rootNode) {
        root = rootNode;
    }
    //前序递归
    public void preOrder() {
        if (this.root != null)
            root.preOrder();
        else
            System.out.println("二叉树为空");
    }
}

测试

public class BinaryTreeDemo {
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        node1.left = node2;
        node1.right = node3;
        node3.left = node4;
        node3.right = node5;
        System.out.println(node1.toString());
        BinaryTree binaryTree = new BinaryTree(node1);
        System.out.println("前序遍历")
        binaryTree.preOrder();
    }
}

TreeNode{val=1, left=TreeNode{val=2, left=null, right=null}, right=TreeNode{val=3, left=TreeNode{val=4, left=null, right=null}, right=TreeNode{val=5, left=null, right=null}}}
前序遍历
1
2
3
4
5

中序遍历及后续遍历全部代码:

public class BinaryTreeDemo {
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        node1.left = node2;
        node1.right = node3;
        node3.left = node4;
        node3.right = node5;
        System.out.println(node1.toString());
        BinaryTree binaryTree = new BinaryTree(node1);
        System.out.println("前序遍历");
        binaryTree.preOrder();
        System.out.println("中序遍历");
        binaryTree.infixOrder();
        System.out.println("后序遍历");
        binaryTree.rearOrder();
    }
}
// 树结点类
class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    public TreeNode() {
        val = 0;
    }
    public TreeNode(int value) {
        val = value;
    }

    @Override
    public String toString() {
        return "TreeNode{" +
                "val=" + val +
                ", left=" + left +
                ", right=" + right +
                '}';
    }

    public void preOrder() {
        System.out.println(this.val);
        if (this.left != null) {
            this.left.preOrder();
        }
        if (this.right != null) {
            this.right.preOrder();
        }
    }

    public void infixOrder() {
        if (this.left != null) {
            this.left.infixOrder();
        }
        System.out.println(this.val);
        if (this.right != null) {
            this.right.infixOrder();
        }
    }

    public void rearOrder() {
        if (this.left != null)
            this.left.rearOrder();
        if (this.right != null)
            this.right.rearOrder();
        System.out.println(this.val);
    }
}
// 二叉树类
class BinaryTree {
    TreeNode root;
//    public BinaryTree() {
//        root = new TreeNode();
//        left = root.left;
//        right = root.right;
//    }
    public BinaryTree(TreeNode rootNode) {
        root = rootNode;
    }
    public void preOrder() {
        if (this.root != null)
            root.preOrder();
        else
            throw new RuntimeException("The Binary Tree is Empty")
    }
    public void infixOrder() {
        if (this.root != null)
            root.infixOrder();
        else
            throw new RuntimeException("The Binary Tree is Empty");
    }
    public void rearOrder() {
        if (this.root != null)
            root.rearOrder();
        else
            throw new RuntimeException("The Binary Tree is Empty");
    }
}

TreeNode{val=1, left=TreeNode{val=2, left=null, right=null}, right=TreeNode{val=3, left=TreeNode{val=4, left=null, right=null}, right=TreeNode{val=5, left=null, right=null}}}
前序遍历
1
2
3
4
5
中序遍历
2
1
4
3
5
后序遍历
2
4
5
3
1

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/959808.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号