搜索资源列表
lll333
- 这是一个利用扩展先序二叉树建立二叉树,并采用先序,中序,后序进行遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and a first sequence, sequence, After traversal sequence for the algorithm!
fei333
- 这是一个利用扩展先序二叉树建立二叉树,且利用非递归算法进行中序遍历的算法!-This is the first expansion of the use of a binary tree order to establish binary tree, and the use of non - recursive algorithm which preorder algorithm!
66
- 通过和用户交互的形式,按照先序遍历输入一个二叉树,二叉数采用数组的结构存储,按层次遍历给结点编号,父亲结点和左右孩子通过两个公式联系,如父亲结点是i,则左孩子为2i+1,右孩子为2i+2.初始数组均被赋成星号,用户理论上可以输入ASCII码以内的任何值,但为了利于验证,只能输入可见字符(除作为标志的星号,回车表示该结点没有数据). 该程序的先序建树,先序输出以及中序输出是采用栈和循环实现的,后序输出是用递归来实现的,在先序建树子程序中,利用反逻辑,将叶子结点,树建完成,和用户输入回车等情况用
filesystem
- 使用ftw函数对目录进行遍历，函数原型是： int ftw(const char*dirpath, int(*fn)(const char*fpath, const struct stat *sb, int typeflag), int nopenfd) ftw函数遍历位于dirpath目录下的目录树，往下一层层地递归式遍历子目录 -Deepen the understanding of linux file system
bianli
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a particular search along the line, followed on the tree each node are done once and only once to visit. Access node operation done de
twotrees
- 二叉树的数据结构算法 包括二叉树的创建、遍历、输出等，可以作为课程设计的原材料-Binary tree data structure algorithms, including tree creation, traversal, output and so on, can be used as raw materials for curriculum design
expmt3
- UNIX下编程：目录树的遍历。包含文件:apue.h、error2e.c、pathalloc.c、3.c-Under UNIX Programming: the traversal tree. Include file: apue.h, error2e.c, pathalloc.c, 3.c
erchashubianli
- 此程序为c语言编写，可以实现二叉树的先，中，后遍历-This procedure for the c language, the first binary tree can be achieved, during and after the traversal
bitree
- 实现二叉树的基本功能，如构造一棵二叉树，在树中插入结点，先序后序中序遍历二叉树等功能-The basic function of the realization of binary tree, such as a binary tree structure, inserted in the tree nodes, in sequence after the first order binary tree traversal functions
Maptheepthoftraversal
- 数据结构对二叉树的深度遍历用进栈，出栈的方法。-The depth of the binary tree data structure traversal to use into the stack, a stack method.
huffman
- 哈夫曼树的构造算法,提供对二叉排序树的遍历。-Hoffmann tree structure algorithm，Provide for binary sort tree traverse.
5551
- 利用数据结构的知识生成一颗二叉树，利用非递归的算法遍历二叉树，主要借助栈来遍历二叉树-Data structures generated using a binary tree of knowledge, use of non-recursive binary tree traversal algorithm, the main stack to traverse binary tree with
66666
- 创建一颗线索二叉树，主要利用了数据结构的知识和递归算法，最后能够遍历整颗树的信息-Creating a threaded binary tree, the main advantage of the knowledge and recursive data structures algorithms, and finally be able to traverse the whole tree information
ReadLog
- 使用CTreeCtrl遍历硬盘所有文件，然后显示出来，点击树节点，在右边的CListCtrl里用图标显示出该文件下的文件，鼠标左键点击某文件，实现打开文件的功能。 功能类似于WINDOWS的文件夹功能-CTreeCtrl traverse all the files using the hard disk, and then displayed, click on the tree node, the right to use CListCtrl in icon shows the file
Xpath
- 除了一步步遍历文档树查找元素外，Libxml2包含支持使用Xpath表达式取得指定结点集。完整的Xpath API文档在这里。Xpath允许通过路径文档搜索匹配指定条件的结点。-Using XPath requires setting up an xmlXPathContext and then supplying the XPath expression and the context to the xmlXPathEvalExpression function. The funct
bianli
- VC++遍历文件夹自动生成目录树,有兴趣的朋友学习一下。 -VC++ folder automatically traverse the directory tree, friends who are interested to learn about.
BTree
- 二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....
Binary-Tree
- 数据结构中树的遍历及其线索化的显示，与严蔚敏一书中的例子几乎一致。-Data structure in the tree traversal clues display almost identical, and Yan Wei Min book example.
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th
btree
- 树的一些常见操作，树的创建，树节点删除，树的遍历。-Some common operations of tree, tree, the tree node deletion, tree traversal.