Search - BinaryTree.h

Search - BinaryTree.h - List

[Other resource] bintytrees DL : 0: 二进制查找树实现代码 BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
Update : 2008-10-13 Size : 13.55kb Publisher : xg
[Other] binarytree-bianli DL : 0: 从键盘输入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.
Update : 2008-10-13 Size : 5.58kb Publisher : cara
[Other resource] BinaryTree DL : 0: 二叉树的数据结构的代码，条理清晰，内容详细，有.CPP和.h文件
Update : 2008-10-13 Size : 14.55kb Publisher : 郑毅
[Other resource] bintytrees DL : 0: 二进制查找树实现代码 BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
Update : 2025-02-17 Size : 13kb Publisher : xg
[Other] binarytree-bianli DL : 0: 从键盘输入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.
Update : 2025-02-17 Size : 5kb Publisher : cara
[Compress-Decompress algrithms] LZW_src DL : 0: LZW 压缩算法想必大家都很熟悉很多压缩壳就是使用此算法 -LZW compression algorithm must be very familiar with a lot of U.S. shell is compressed using this algorithm
Update : 2025-02-17 Size : 16kb Publisher :
[Data structs] BinaryTree DL : 0: 二叉树的数据结构的代码，条理清晰，内容详细，有.CPP和.h文件-Binary tree data structure of the code, the clarity of the content in detail, there. CPP and. H file
Update : 2025-02-17 Size : 1.01mb Publisher : 郑毅
[Other] AnAlgorithmicViewonOVSFCode DL : 0: 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
Update : 2025-02-17 Size : 154kb Publisher : shilei
[Data structs] data_structure3 DL : 0: 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
Update : 2025-02-17 Size : 5kb Publisher : XS
[Data structs] Chap4_BinaryTree DL : 0: 二叉树类代码。其中包括逻辑结构、存储结构和各种增删查找的功能。需要用的时候只需#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
Update : 2025-02-17 Size : 33kb Publisher : 朱迪
[Data structs] BinaryTree DL : 0: 编程实现二叉树的存储结构与基本算法，主要包括以下功能：  创建二叉树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
Update : 2025-02-17 Size : 57kb Publisher : 郭培鑫