Location:
Search - BinaryTree.h
Search list
Description: 二进制查找树实现代码
BinaryTree.c
BinaryTree.h
bst.dsp
TreeClient.c
item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
Platform: |
Size: 13871 |
Author: xg |
Hits:
Description: 从键盘输入9个字符F B A D E C H G M。
• 查找结点E，并输出该结点的指针。
• 前序、中序和后序遍历输出该二叉树。
-input from the keyboard characters F 9 A B C D E G H M.
Platform: |
Size: 5710 |
Author: cara |
Hits:
Description: 二叉树的数据结构的代码，条理清晰，内容详细，有.CPP和.h文件
Platform: |
Size: 14902 |
Author: 郑毅 |
Hits:
Description: 二进制查找树实现代码
BinaryTree.c
BinaryTree.h
bst.dsp
TreeClient.c
item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
Platform: |
Size: 13312 |
Author: xg |
Hits:
Description: 从键盘输入9个字符F B A D E C H G M。
• 查找结点E，并输出该结点的指针。
• 前序、中序和后序遍历输出该二叉树。
-input from the keyboard characters F 9 A B C D E G H M.
Platform: |
Size: 5120 |
Author: cara |
Hits:
Description: LZW 压缩算法想必大家都很熟悉
很多压缩壳就是使用此算法
-LZW compression algorithm must be very familiar with a lot of U.S. shell is compressed using this algorithm
Platform: |
Size: 16384 |
Author: |
Hits:
Description: 二叉树的数据结构的代码，条理清晰，内容详细，有.CPP和.h文件-Binary tree data structure of the code, the clarity of the content in detail, there. CPP and. H file
Platform: |
Size: 1058816 |
Author: 郑毅 |
Hits:
Description: The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results-The combinatorial core of the OVSF code assignment problemthat arises in UMTS is to assign some nodes of a complete binarytree of height h (the code tree) to n simultaneous connections, such thatno two assigned nodes (codes) are on the same root-to- leaf path. Eachconnection requires a code on a specified level. The code can change overtime as long as it is still on the same level. We consider the one-step codeassignment problem: Given an assignment, move the minimum number ofcodes to serve a new request. Minn and Siu proposed the so-called DCAalgorithmto solve the problem optimally. We show that DCA does notalways return an optimal solution, and that the problem is NP-hard.We give an exact nO (h)-time algorithm, and a polynomial time greedyalgorithm that achieves approximation ratio Θ (h). Finally, we considerthe online code assignment problem for which we derive several results
Platform: |
Size: 157696 |
Author: shilei |
Hits:
Description: 9、优先级队列
QueueNode.h
Compare.h
PriorityQueue.h
Test.cpp
10、串 88
MyString.h
MyString.cpp
test.cpp
11、二叉树
BinTreeNode.h
BinaryTree.h
Test.cpp
12、线索二叉树
ThreadNode.h
ThreadTree.h
ThreadInorderIterator.h
test.cpp -9, priority queue QueueNode.h Compare.h PriorityQueue.h Test.cpp 10, Series 88 MyString.h MyString.cpp test.cpp 11, binary tree BinTreeNode.h BinaryTree.h Test.cpp 12, clues to binary tree ThreadNode.h ThreadTree.h ThreadInorderIterator.h test.cpp
Platform: |
Size: 5120 |
Author: XS |
Hits:
Description: 二叉树类代码。其中包括逻辑结构、存储结构和各种增删查找的功能。需要用的时候只需#include "BinaryTree.h"即可-Binary tree class code. Including logical structure, storage structure and function of a variety of additions and deletions are looking for. When needed just# include " BinaryTree.h" to
Platform: |
Size: 33792 |
Author: 朱迪 |
Hits:
Description: 编程实现二叉树的存储结构与基本算法，主要包括以下功能：
创建二叉树B的二叉链
二叉树B：A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))
通过对二叉树B的操作，输出二叉树B的广义表（字符串）表达式
通过对二叉树B的操作，输出H结点的左孩子与右孩子
通过对二叉树B的操作，出二叉树B的深度
通过对二叉树B的操作，计算出二叉树B的结点个数
通过对二叉树B的操作，计算出二叉树B的叶子结点个数
通过对二叉树B的操作，输出二叉树B的先序遍历序列
通过对二叉树B的操作，输出二叉树B的中序遍历序列
通过对二叉树B的操作，输出二叉树B的后序遍历序列
释放二叉树B-Programming storage structure and basic algorithms binary tree, including the following features: create binary chain binary B binary B' s: A (B (D, E (H (J, K (L, M (, N)))) ), C (F, G (, I))) B through binary operation generalized table output binary tree B (strings) by binary expression B operation, the output of H nodes left child and right children B through binary operation, the depth of a binary tree B B through binary operation to calculate the number of nodes of a binary tree B B through binary operation to calculate the number of leaf nodes of the binary tree B by binary tree B operation, first order output binary tree B traversal sequence through the binary tree B operation, the output of a binary tree B of traversal sequence through the binary tree B operation, after the sequence output binary tree B traversal sequence release binary Tree B
Platform: |
Size: 58368 |
Author: 郭培鑫 |
Hits: