Search - Erchashu

[Other resource] shu&erchashu

Description: 用c++实现的数据结构中树和二叉树的各种运算
Platform: | Size: 591317 | Author: 何某某 | Hits:

[Other resource] shujujiegou-erchashu

Description: 叉排序树与平衡二叉排序树基本操作的实现用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \\ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!" / "NO!" ;
Platform: | Size: 2028 | Author: 胡图 | Hits:

[Other resource] erchashu

Description: 数据结构中二叉树用c实现的算法-binary tree data structure used to achieve the algorithm c
Platform: | Size: 1072 | Author: 王宇 | Hits:

[Other] erchashu

Description: 建立二叉树，统计二叉树中度为2的结点个数和叶子结点个数（用递归或非递归的方法都可以，先序、中序或后序均可）-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non - recursive method can be first order, After the order or sequence may)
Platform: | Size: 811 | Author: ahui | Hits:

[Other resource] erchashu

Description: 是一个用C语言写的二叉树排序程序，希望对大家有帮助。
Platform: | Size: 1489 | Author: li coco | Hits:

[Develop Tools] erchashu

Description: 这是我做数据结构课程设计里面的一个设计程序，二叉树排序
Platform: | Size: 4991 | Author: 黎秋雁 | Hits:

[Windows Develop] erchashu

Description: 树型结构是一类重要的非线性数据结构，而二叉树是最为重要，最为常用的类型。树结构在客观世界中广泛存在，如人类社会的族谱和各种社会组织机构都可以用树来形象表示。树在计算机领域中也得到广泛应用，如在编译程序中，可用树来表示源程序的语法结构。而即使是一般的树都能简单地转化为二叉树，因此二叉树显得特别重要。该软件主要是利用完全二叉树的性质建立一棵二叉树，然后运用二叉链表与栈对二叉树进行复合操作，并实现各种功能。具体包括建立二叉树、遍历二叉树、求二叉树的深度、求二叉树的叶子结点。其中遍历二叉树包含三种方法：先序遍历、中序遍历与后序遍历，这三种遍历都分别运用了两种不同的算法，即递归算法与非递归算法。最后软件使用循环语句将上述的操作封装起来，使之能够进行可重复、连续的操作。
Platform: | Size: 2875 | Author: 彭枝考 | Hits:

[Other] erchashu

Description: 1）以二叉链表或三叉链表作为二叉树的存储结构； 2）以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法；
Platform: | Size: 186644 | Author: mhb | Hits:

[Other] erchashu

Description: 建立二叉树，统计二叉树中度为2的结点个数和叶子结点个数（用递归或非递归的方法都可以，先序、中序或后序均可）-establish binary tree, Statistics for the two binary tree to moderate the number of nodes and the number of nodes leaves (with the recursive and non- recursive method can be first order, After the order or sequence may)
Platform: | Size: 1024 | Author: ahui | Hits:

[Data structs] erchashu

Description: 是一个用C语言写的二叉树排序程序，希望对大家有帮助。-脢脟脪禄赂枚脫脙C脫茂脩脭脨
Platform: | Size: 1024 | Author: li coco | Hits:

[assembly language] erchashu

Description: 1.递归先序遍历 2.递归中序遍历 3.递归后序遍历 4.非递归层序遍历 c语言-1. Recursive preorder traversal 2. Recursive in order traversal 3. Recursive traversal after 4. Non-recursive traversal sequence c language
Platform: | Size: 3072 | Author: 杨飞 | Hits:

[Data structs] erchashu

Description: 判断完全二叉树以及求二叉树深度的递归与非递归算法实现 -Determine the full binary tree and binary tree for the depth of recursive and non-recursive algorithm
Platform: | Size: 1024 | Author: 张金水 | Hits:

[Other] erchashu

Description: (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( ' \ n' ) for the importation of the end of signs, the importation of series L, to generate a binary sort tree T (2) of the binary sort tree traversal of T for the output results (3 ) Calculation of binary sort tree T to find the average successful search length, the output results (4) input element x, to find binary sort tree T, if the existence of the node containing x, then delete the node, and sequencing of times calendar (2 steps) Otherwise output " x does not exist" (5) input element x, to find binary sort tree T, if the tree does not exist整棵with a value of x nodes, then insert the node, and for medium-traversal (2 steps) Otherwise output " x already exists."
Platform: | Size: 1024 | Author: 涂舒 | Hits:

[Windows Develop] erchashu

Description: 1.试按表(10,8,9,12,20,5,6,15,19,25)中元素的排列次序，将所有元素插入一棵初始为空的二叉排序树中，使之仍是一棵二叉排序树，请设计算法 2.在已构建的二叉排序树中插入元素40，使之依然为二叉排序树 -1. Examination table (10,8,9,12,20,5,6,15,19,25) elements in order to insert all the elements of an initial empty binary tree sort, so that is still one of the binary sort tree, please design algorithm 2. in order to build the binary tree insertion element 40, so that remains to Binary Sort Tree
Platform: | Size: 23552 | Author: ls | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list

[Other resource] shu&erchashu

[Other resource] shujujiegou-erchashu

[Other resource] erchashu

[Other] erchashu

[Other resource] erchashu

[Develop Tools] erchashu

[Windows Develop] erchashu

[Other] erchashu

[Other] erchashu

[Data structs] erchashu

[assembly language] erchashu

[Data structs] erchashu

[Other] erchashu

[Windows Develop] erchashu

[File Format] erchashu

[Compress-Decompress algrithms] erchashu

[Data structs] erchashu

[Data structs] erchashu

[Data structs] erchashu

[Data structs] erchashu

CodeBus www.codebus.net