Java输出一个二叉树

最新推荐文章于 2023-03-30 11:07:50 发布

许七安LIU

最新推荐文章于 2023-03-30 11:07:50 发布

阅读量533

点赞数

文章标签： java 数据结构开发语言

本文链接：https://blog.csdn.net/weixin_45090673/article/details/125628594

版权

1、先在一个类里定义左右结点和构造器
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、然后在另一个类里调用该类和构造器
public class Tree {
public static void main(String[] args)
{
//Tree tree=new Tree();
TreeNode p1=new TreeNode(7,null,null);
TreeNode p2=new TreeNode(6,null,null);
TreeNode p3=new TreeNode(5,null,null);
TreeNode p4=new TreeNode(4,null,null);
TreeNode p5=new TreeNode(3,p2,p1);
TreeNode p6=new TreeNode(2,p4,p3);
TreeNode p7=new TreeNode(1,p6,p5);
System.out.println(p5.left.val);
System.out.println(p5.right.val);
}
}