满二叉树的判定
2021/10/19 23:40:10
本文主要是介绍满二叉树的判定,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
/** * 满二叉树的判定 */ public class FullBinaryTree { public static void main(String[] args) { BinaryTreeNode node1 = new BinaryTreeNode(1); BinaryTreeNode node2 = new BinaryTreeNode(2); BinaryTreeNode node3 = new BinaryTreeNode(3); BinaryTreeNode node4 = new BinaryTreeNode(4); BinaryTreeNode node5 = new BinaryTreeNode(5); BinaryTreeNode node6 = new BinaryTreeNode(6); BinaryTreeNode node7 = new BinaryTreeNode(7); BinaryTreeNode node8 = new BinaryTreeNode(8); BinaryTreeNode node9 = new BinaryTreeNode(9); node1.left = node2; node1.right = node3; node3.left = node4; ReturnData data = isFull(node1); System.out.println(data.node_num == ((int) Math.pow(2, data.height) - 1)); } public static class ReturnData { int height; int node_num; public ReturnData(int height, int node_num){ this.height = height; this.node_num = node_num; } } public static ReturnData isFull(BinaryTreeNode root){ if (root == null){ return new ReturnData(0, 0); } ReturnData left = isFull(root.left); ReturnData right = isFull(root.right); int height = (Math.max(left.height, right.height)) + 1; int node_num = left.node_num + right.node_num + 1; return new ReturnData(height, node_num); } }
这篇关于满二叉树的判定的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-07-02springboot项目无法注册到nacos-icode9专业技术文章分享
- 2024-06-26结对编程到底难不难?答案在这里
- 2024-06-19《2023版Java工程师》课程升级公告
- 2024-06-15matplotlib作图不显示3D图,怎么办?
- 2024-06-1503-Loki 日志监控
- 2024-06-1504-让LLM理解知识 -Prompt
- 2024-06-05做软件测试需要懂代码吗?
- 2024-06-0514-ShardingSphere的分布式主键实现
- 2024-06-03为什么以及如何要进行架构设计权衡?
- 2024-05-31全网首发第二弹!软考2024年5月《软件设计师》真题+解析+答案!(11-20题)