Search - binary AND tree

Search - binary AND tree - List

[Mathimatics-Numerical algorithms] 本代码演示了平衡排序二叉树的实现，并用到了智能指针 DL : 0: 本代码演示了平衡排序二叉树的实现，并用到了智能指针等技术-demonstration of the code balanced binary tree in order to achieve, and used an intelligent guide technology
Date : 2008-10-13 Size : 13.05kb User : 李名
[Mathimatics-Numerical algorithms] 顺序二叉树和树的复制及哈夫曼编码 DL : 0: 顺序二叉树和树的复制及哈夫曼编码-sequence binary tree and the tree reproduction and Huffman coding
Date : 2008-10-13 Size : 4.9kb User : 任文旭
[Mathimatics-Numerical algorithms] TernarySearchTrees DL : 0: 多重搜索树算法，性能和二叉树算法相当，但是更节省空间-multiple search tree algorithm performance and Binary Tree Algorithm considerable, but the space-saving
Date : 2008-10-13 Size : 1.92kb User : 段宝平
[Mathimatics-Numerical algorithms] BTree3_src_vc6 DL : 1: 根据前序序列和中序序列生成二叉树并进行遍历。-sequence and the sequence sequence sequence generation and binary tree traversal.
Date : 2008-10-13 Size : 4.75kb User : 黄炜娟
[Mathimatics-Numerical algorithms] 二叉树的各种操作 DL : 0: 二叉树的各种操作,实现插入,查找,删除等功能-binary tree operation, and achieve insert, search, delete function
Date : 2008-10-13 Size : 7.89kb User : 韩文辉
[Mathimatics-Numerical algorithms] 2309 DL : 0: 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as \"What are the minimum and maximum numbers in the subtree whose root node is X?\" Please try to find answers for there queries.
Date : 2008-10-13 Size : 13.63kb User : pengfam
[Mathimatics-Numerical algorithms] 第六章树和二叉树习题答案 DL : 0: 第六章树和二叉树习题答案-The answer of tree and binary tree
Date : 2008-10-13 Size : 13.41kb User : 陈如
[Mathimatics-Numerical algorithms] 二叉数运算 DL : 0: 无递归二叉树插入及中序等顺带求得深度等-Non-recursive binary tree insertion sequence, such as passing and seek depth
Date : 2026-01-01 Size : 1kb User : 道奇蝰蛇
[Mathimatics-Numerical algorithms] 本代码演示了平衡排序二叉树的实现，并用到了智能指针 DL : 0: 本代码演示了平衡排序二叉树的实现，并用到了智能指针等技术-demonstration of the code balanced binary tree in order to achieve, and used an intelligent guide technology
Date : 2026-01-01 Size : 13kb User :
[Mathimatics-Numerical algorithms] treebintree DL : 0: （1）输入字符序列，建立二叉链表。（2）中序遍历二叉树:递归算法。（3）中序遍历二叉树:非递归算法（最好也能实现先序，后序非递归算法）。（4）求二叉树的高度。（5）求二叉树的叶子个数。（6）建立中序线索二叉树，并实现中序遍历。（8）借助队列实现二叉树的层次遍历。（9）在主函数中设计一个简单的菜单，分别调试上述算法。 -(1) input sequence of characters, the establishment of binary list. (2) traversal of binary tree: recursive algorithm. (3) in order binary tree traversal: Non-recursive algorithm (the best can achieve the first order, after the sequence of non-recursive algorithm). (4) for tree height. (5) for the number of tree leaves. (6) in order to establish clues to binary tree and traversal implementation. (8) through the queue to achieve the level of binary tree traversal. (9) in the main function in the design of a simple menu, respectively, the above algorithm debugging.
Date : 2026-01-01 Size : 315kb User : jack
[Mathimatics-Numerical algorithms] 2309 DL : 0: 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries. -Peking University ACM competitions topics Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as
Date : 2026-01-01 Size : 13kb User : pengfam
[Mathimatics-Numerical algorithms] jueceshu DL : 0: 决策树 cart 二叉树代码，简要算法与说明-Decision tree cart binary tree code algorithm and briefly explain
Date : 2026-01-01 Size : 2kb User : and
[Mathimatics-Numerical algorithms] bstree DL : 0: 实现二叉排序树的显示、插入、删除、查找等功能-Binary sort tree to achieve the display, insert, delete, search and other functions
Date : 2026-01-01 Size : 30kb User : 吴超
[Mathimatics-Numerical algorithms] RBTreeCode DL : 0: 红黑树和二叉查找树数据结构的实现以及二者的性能比较的C语言实现代码-Red and black binary search tree and the tree data structure, as well as the achievement of the performance comparison between the C language code
Date : 2026-01-01 Size : 230kb User : 张辉
[Mathimatics-Numerical algorithms] traverse-binary-tree DL : 0: 二叉树的先序中序以及后序遍历及深度输出代码简短有效无措-Binary tree traversal and depth of the output
Date : 2026-01-01 Size : 1kb User : 张子腾
[Mathimatics-Numerical algorithms] rbtree DL : 0: 实现红黑树的相关算法，红黑树、二叉搜索树的实现和性能比较-Red-black tree, binary search tree implementation and performance comparison
Date : 2026-01-01 Size : 12kb User : shitou
[Mathimatics-Numerical algorithms] tree DL : 0: 二叉树的基本操作及哈夫曼编码译码系统的实现-The basic binary operations and implementation of Huffman coding and decoding system
Date : 2026-01-01 Size : 1kb User : 吴润
[Mathimatics-Numerical algorithms] tree DL : 0: 运用递归算法创建二叉树，并实现先序、中序、后序排列-Recursive algorithm used to create binary tree, and to achieve the first order, in order, after the sequence alignment
Date : 2026-01-01 Size : 1kb User : cuilei
[Mathimatics-Numerical algorithms] xxx DL : 0: 二叉搜索树相关内容并进行前序后序中序周游-Binary search tree prior to the relevant content and order in the sequence after the tour sequence
Date : 2026-01-01 Size : 1kb User : victor
[Mathimatics-Numerical algorithms] erchashushixian DL : 0: 二叉排序树的实现实现二叉排序树，包括生成、插入，删除；对二叉排序树进行先根、中根、和后根非递归遍历；每次对树的修改操作和遍历操作的显示结果都需要在屏幕上用树的形状表示出来。 -英语中文德语检测语言中文(简体)英语日语翻译文字或网页二叉排序树的实现实现二叉排序树，包括生成、插入，删除；对二叉排序树进行先根、中根、和后根非递归遍历；每次对树的修改操作和遍历操作的显示结果都需要在屏幕上用树的形状表示出来。请键入文字或网站地址，或者上传文档。取消 È r chā páixù shù de shíxiàn shíxiàn èr chā páixù shù, bāokuò shēngchéng, chārù, shānchú duì èr chā páixù shù jìnxíng xiān gēn, zhōnggēn, hé hòu gēn fēi dìguī biànlì měi cì duì shù de xiūgǎi cāozuò hé biànlì cāozuò de xiǎnshì jiéguǒ dōu xūyào zài píngmù shàng yòng shù de xíngzhuàng biǎoshì chūlái.Achieve binary sort tree Achieve binary sort tree, including the generation, insert, delete For the first binary sort tree root, root, root and non-recursive traversal Every modification operations on the tree traversal operation and the results are displayed on the screen needs to be expressed in the shape of the tree.
Date : 2026-01-01 Size : 2kb User : windin

« 12 »