登录
首页 » Visual C++ » BiTree

BiTree

于 2016-04-05 发布 文件大小:1KB
0 188
下载积分: 1 下载次数: 1

代码说明:

  本算法用于实现二叉树的查找和输出,使用了数据结构中的二叉树结构,精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)

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

发表评论

0 个回复

  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • maze
    c语言完成的数据结构几个小算法游戏包括迷宫求解等(C language of complete data structure several small algorithm game includes maze solution, etc )
    2012-03-29 20:37:18下载
    积分:1
  • arc
    运用二叉树求代数表达式的值,将代数表达式的每个符号用二叉树结点表示,遍历图的每一结点,按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
    2012-06-23 19:52:38下载
    积分:1
  • JGMFC
    一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
    2010-03-11 16:13:32下载
    积分:1
  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分:1
  • polynomial
    本程序实现一元多项式合并。本程序输入方式为按项输入,每输入一个项,会先提示输入项的幂,再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
    2009-12-16 17:29:54下载
    积分:1
  • xianxingbiao
    另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
    2007-12-07 20:20:32下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • mataqipan
    马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
    2006-05-30 20:05:17下载
    积分:1
  • BinaryTree
    二叉树实现,整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
    2012-12-28 10:40:23下载
    积分:1
  • 696518资源总数
  • 106010会员总数
  • 4今日下载