搜索资源列表
2011010963_e4
- THUEE数据与算法实验四： 1、二叉树的所有结点的关键字由文件输入，其中关键字均为一个整数，构造增强二叉搜索树，并统计树的层高，按要求把结果输出到文件中。 2、给定两个增强二叉搜索树P和T，判断从形状上（不考虑结点关键字值）P是否等于T的某个子树，即T是否包含P。（最好对于任意形式二叉树均可实现比较，不仅限于二叉搜索树）-THUEE four experimental data and algorithms: a keyword all nodes by binary file inp
c-cpp
- (1) 实现二叉树先序遍历、中序遍历、后序遍历等运算。 (2) 实现计算二叉树叶子结点和交换二叉树中所有结点左右子树的运算 -(1) binary tree preorder, preorder, postorder traversal operations. (2) calculated to achieve binary tree leaf node and all nodes exchange binary sub-tree operations around
TreeControl
- 动态添加、删除树形控件的节点，获取树形控件的选中项-Dynamically add, delete, tree control node, tree control for selected items
er-cha-shu-
- 一棵非空二叉树可以看作是由根结点、左子树和右子树这三个基本部分组成的。如果能依次遍历这三个部分的信息，也就遍历了整个二叉树。由此得到的二叉树的遍历是按某种策略访问二叉树中的每一个结点且仅访问一次的过程。二叉树的遍历按访问根结点的先后次序不同分为前序、中序和后序三种。-A non-empty binary tree can be seen from the root node, the left subtree and right subtree consists of three basic p
1
- 假设树上每个结点所含的数据元素为一个字母，并且以孩子-兄弟链表为树的存储结构，试写一个按凹入表方式打印一棵树的算法-Assuming the data elements contained in each node of the tree is a letter, and with children- brothers list is stored in the structure of the tree, try to write a print statement by way of a t
BST
- A application about binary search tree, Insert, Delete, Find, Print node.
hc_textsplittextone
- The "splitText(offset)" method breaks the Text node into two Text nodes at the specified offset keeping each node as siblings in the tree.
Threaded-Btree
- 对二叉树的一系列操作 1.先序建立二叉树 2.中序遍历二叉树并将其线索化 3.结点前驱和后继 4.搜索二叉树 5.删除指定结点 -A series of operations on a binary tree. Preorder build binary 2 binary tree traversal and cued 3. Predecessor and successor nodes 4 5 binary search. Delete the specified no
erchashu
- 输入完全二叉树前序，实现中序、后序、层次遍历，交换左右子树，统计叶子节点，二叉树深度。使用C语言实现。-Enter the first complete binary tree sequence to achieve the sequence after sequence, hierarchy traversal, the exchange about the sub-tree leaf node statistics, binary tree depth. Using the C.
UiActions
- Performs basic actions on an XML tree: add node, remove node, move up down.
nodenormalize01
- The method "normalize" puts all Text nodes in the full depth of the sub-tree underneath this Node. -The method "normalize" puts all Text nodes in the full depth of the sub-tree underneath this Node.
RTree
- 数据库领域大牛陶宇飞教授采用C++实现的R-tree, 包括Node及Entry的处理.-Distinguished Prof. Yufei Tao in database filed implemented the R-tree using using C++, including the processing of Nodes and Entrys.
dragtreewiew
- Vb创建TreeView节点，并实现节点的拖拽，鼠标选中一个节点后，按下鼠标左键移动节点，可将节点拖动到指定的节点下，在TreeView中，这是一种增强的用法，可拖动的树形菜单控件，以此为参考。源码简单，适合初学者。-Vb create TreeView nodes and nodes to achieve drag the mouse to select a node, press the left mouse button to move the node, the node can be
textsplittextone
- The "splitText(offset)" method breaks the Text node into two Text nodes at the specified offset keeping each node as siblings in the tree.
NodeNormalize
- The method "normalize" puts all Text nodes in the full depth of the sub-tree underneath this Node, including attribute nodes, into a "normal" form where only structure (e.g., elements, comments, processing instructions, CDATA sections, and entity ref
hafuman
- 给定n个权值作为n个叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。通过这个程序，可以实现哈弗曼树。-Given n as n weights leaf node, construct a binary tree, if the weighted path length to a minimum, said this is the optimal binary tree, also known as Huffman tre
erchashushiyan
- 创建一个二叉树，实现二叉树的前序，中序，后序排列；输出二叉树的高度和前k个结点的值-Create a binary tree, the realization of binary tree, the preamble of the sequence, after the sequence arrangement The output of the binary tree height and the value of k node before
shenzhan
- C语言下使用链表实现对伸展树操作，包含插入结点，删除，查找等等。-Use the C language to realize the chain stretching tree operations, including the insertion node, delete, search, and so on.
erchashubianli
- 对所建立的二叉树用递归和非递归的中序遍历输出树的结点的算法。-Established algorithm for binary output node of the tree using recursive and non-recursive preorder.
erchashubianli
- 二叉树遍历，先建立二叉树，然后遍历寻找指定节点，输出反向路径-Binary tree traversal, first create a binary tree, then traverse to find the specified node, output reverse path