搜索资源列表
svmBTA
- 一個基於二元樹為結構的svm分多類分類器svm-BTA,將分多類問題是為多個分二類問題，並結合二元樹的構造來達成分類功能。-A new approch for multi-classfication to employ binary tree architecture.
Binarytreedemoprogram
- 本程序设计实现抽象数据类型二叉树的演示程序-Design and Implementation of the program abstract data types binary tree demo program
dada
- 以递归方式按先序序列建立二叉树的二叉链表结构，再分别输出先序、中序、后序的遍历结果-Recursively by first-order sequence of the establishment of a binary tree binary linked list structure, each with output of the first sequence, in order, postorder traversal of the results of
erchashu
- 二叉树的构建掌握基于先序遍历构造二叉链表的算法-Construction of binary tree
10060323
- 搜索1.建立有序表，然后进行二分查找； 2.建立二叉排序树，然后进行查找。-A search. To establish an ordered list, and then binary search 2. Binary sort tree, and then search.
10060324
- 二叉树主要完成以下功能: 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量(size)和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲(Parent)和子女 7.二叉树的遍历 8.二叉树的输出-Main binary tree complete the following features: 1. The establishment of a binary tree. Calculate the junction point w
optimal-binary-tree
- 这个程序通过dp来构建最优的二叉树，使得效率更好，将高概率的结点放在高处。通过o（n^2)实现。-To build this program by dp optimal binary tree, making better efficiency, the high probability of the node on the height. O (n ^ 2).
CTree
- 该程序是实现双亲表的算法，主要用于二叉树的应用-The procedure is the algorithm of the parent table, mainly used for the application of the binary tree
zhebanchazhao
- Two forks the tree: binary search, for the realization of two binary tree binary search.
classical-algorithm-VCPP
- 常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等-The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.
zuoye
- 二叉树遍历，包括前中后序递归遍历和计算椰子树和节点数-Binary tree traversal, including former in after sequence recursively traverse and calculation of coconut trees and the number of nodes
Cpp1
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
6BinaryTree
- 利用二叉树实现十进制四则运算，并输出结果-Binary tree decimal arithmetic, and outputs the result.
ExamCpp--
- 单链表，单循环链表，双链表，循环双链表的实现，二叉树的遍历与实现。森林与树的转换以及图的深度广度遍历，邻接矩阵邻接表实现-Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of
Btree1
- 二叉树的创建，查找遍历，插入，删除，输出-Create a binary tree, traversal search, insert, delete, output
1211
- 给出一棵二叉树的结构,判断这棵二叉树是不是完全二叉树-Given a binary tree structure, the judge is not complete binary tree binary tree
ArbolB
- Binary Tree implementation C-Binary Tree implementation C++
BINARYTREEC
- Binary Tree implementation C-Binary Tree implementation C++
1033341_revise3
- 利用演算法的binary tree 來尋找edge及vertex中最短路徑的最大重量-using the algorithm to find between the edge and vertex maximum weight