登录
首页 » Java » tree

tree

于 2016-03-18 发布 文件大小:1KB
0 213
下载积分: 1 下载次数: 1

代码说明:

  判断二叉树是否是完全二叉树,求二叉树宽度1:若无左子女则不应该有右子女2.求二叉树宽度3.二叉树k层叶子结点(Determine whether the binary tree is a complete binary tree, binary tree width 1: children should not be left if no children have the right width 3. 2. binary tree binary tree leaf node k layer)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 二叉树dsff soih o ijd sh
    二叉树dsff soih o ijd sh-erchashuddddddddddddddddddddddddddddddd
    2023-06-18 10:05:03下载
    积分:1
  • 用C语言实现的各种算法及演示,可以合代码分步观看执行过程...
    用C语言实现的各种算法及演示,可以结合代码分步观看执行过程-C language algorithms and the various presentations, combining code can watch the step-by-step implementation process
    2022-01-26 07:49:12下载
    积分:1
  • 123
    校园导航系统 1) 校园景点介:绍介相关景点的有关详细信息。 2) 最佳路线查询:查询校园中任意两点之间所有路线,并提供两点间最短的简单路径。 3) 关节点查询:提供校园图的关节点查询。 4) 多景点最佳路线查询:提供多个景点的最佳线路查询,即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
    2011-08-25 08:56:05下载
    积分:1
  • 利用栈来完成实习的魔王语言.完成基本内容.
    利用栈来完成数据结构实习的魔王语言.完成基本内容.-use to complete stack data structure attachment fiendish language. Completion of the basic content.
    2022-02-12 20:24:25下载
    积分:1
  • sqlite 3.3.8 supports encrypted version
    sqlite 3.3.8 支持加密的版本-sqlite 3.3.8 supports encrypted version
    2022-02-06 02:30:15下载
    积分:1
  • This is the bus company old man card issuance management software, simple and pr...
    这是公交公司老年证发放管理软件,简单实用-This is the bus company old man card issuance management software, simple and practical
    2022-03-07 07:30:51下载
    积分:1
  • Huffman算法的应用是Huffman编码使用一篇文章..
    哈夫曼算法的应用是一篇关于使用哈夫曼编码和解码树的文章,其中包含了对文档的详细描述
    2022-03-01 14:52:01下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • 编译通过操作表的顺序操作的顺序
    tc按顺序编译的手术台链式操作
    2023-01-02 13:30:17下载
    积分:1
  • MyQueue
    简单的队列实现,从中可以学习到怎样实现队列的算法编程(Simple queue implementation, from which you can learn how to achieve the queue algorithm programming)
    2013-07-24 19:50:13下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载