登录
首页 » 数据结构 » 用C++写的寻找公共祖先,实现树的先序后序中序层次遍历,内有实验报告可以参阅。...

用C++写的寻找公共祖先,实现树的先序后序中序层次遍历,内有实验报告可以参阅。...

于 2022-03-06 发布 文件大小:25.71 kB
0 208
下载积分: 2 下载次数: 1

代码说明:

用C++写的寻找公共祖先,实现树的先序后序中序层次遍历,内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.

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

发表评论

0 个回复

  • pb 源码 运行程序但不显示窗口
    pb 源码 运行程序但不显示窗口-pb-source operating procedures but did not display window
    2023-05-27 00:25:03下载
    积分:1
  • Traverse the adjacent table and adjust the implementation of Boolean adjacency m...
    遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.
    2022-05-04 22:05:01下载
    积分:1
  • PieChartCtrl用C++开发的管理系统
    PieChartCtrl用C++开发的管理系统-PieChartCtrl C++ development management system
    2022-01-26 02:14:25下载
    积分:1
  • 离散点插值程序,采用的是cressman客观插值原理
    离散点插值程序,采用的是cressman客观插值原理-discrete points interpolation procedure, the objective is cressman interpolation Principle
    2022-03-23 15:55:46下载
    积分:1
  • 迷宫的又一解法。该算法简单、实用、可读性强,是学习递归和回溯很好的例子。
    迷宫的又一解法。该算法简单、实用、可读性强,是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.
    2022-03-05 14:22:00下载
    积分:1
  • 上的地图遍历,任意节点建,深度和广度…
    数据结构中关于图的遍历,任意建节点,深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods
    2022-03-21 20:05:53下载
    积分:1
  • mysql db utils 还原和备份
    这是 mysql db utils project.it 支持还原和 mysql.it 的备份是轻量化的项目。它是更多友好比命令行。更多的是轻型比其它工具。 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
    2022-02-12 11:08:00下载
    积分:1
  • 考勤管理系统源码
    考勤管理系统源码-Attendance Management System FOSS
    2023-08-03 09:15:03下载
    积分:1
  • 栈(stack)是程序设计过程中经常遇到朝气一种形式,它对于的存放和操作有下面这样的特点: 1) 它只有一个对进行存入和取出的端口; 2) 后进...
    栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式,它对于数据的存放和操作有下面这样的特点: 1) 它只有一个对数据进行存入和取出的端口; 2) 后进者先出,即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器,每次只可以从顶端压入一个硬币,而取出也只可以从顶端进行,即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如,编译系统中(这是一类比较复杂的程序),对于函数调用的处理、对于表达式计算的处理,都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe
    2023-08-22 21:50:04下载
    积分:1
  • java通过ODBC JDBC桥完成库的操作简单代码
    java通过ODBC JDBC桥完成数据库的操作简单代码-java through ODBC database JDBC Bridge completed the simple code
    2022-01-28 01:55:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载