登录
首页 » Visual C++ » 0829-Binary-Tree

0829-Binary-Tree

于 2012-11-28 发布 文件大小:14KB
0 262
下载积分: 1 下载次数: 4

代码说明:

  二叉搜索树的生成和查找节点,北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)

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

发表评论

0 个回复

  • yuesefu
    约瑟夫问题,通过C语言对约瑟夫问题进行了分析和讲解,从而解决问题(Joseph problems, by Joseph C language issues are analyzed and explained, in order to solve the problem)
    2011-10-26 10:56:33下载
    积分:1
  • ds-labs
    说明:  数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
    2011-03-27 03:01:02下载
    积分:1
  • josephus
    通过c语言数组算法解决josephus问题,m个人围成一圈,从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开,最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
    2017-11-12 10:30:06下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • 哈夫曼树解码和编码
    哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
    2023-04-13 11:00:11下载
    积分:1
  • code
    C++实现的两类问题随机森林生成算法,对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
    2020-06-29 22:20:02下载
    积分:1
  • BinarySortTree
    二叉排序树,可以实现插入,删除,查找,创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)
    2009-12-03 10:53:04下载
    积分:1
  • Phone-book
    数据结构课程设计 -电话本(运用了MFC图形化界面)(Curriculum design- the phone book)
    2015-03-09 22:04:07下载
    积分:1
  • migong
    迷宫问题,利用随机数自动生成迷宫,并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )
    2021-04-26 16:48:45下载
    积分:1
  • chessboard-distance
    一道poj上的问题的解答,棋盘上的距离问题。即实现棋盘上从一个点移动到王,后,兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
    2012-06-20 10:10:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载