Search - binary AND tree

Search - binary AND tree - List

[Software Engineering] 抽象数据类型实现 DL : 0: 二叉树抽象数据类型的实现问题说明：数据结构来实现二叉树具体函数功能的实现；以及相关操作。-binary tree abstract data types realization : data structures to achieve specific function in a binary tree the realization; , and related operations.
Date : 2026-01-01 Size : 3kb User : 张君
[Software Engineering] shujujiegou-erchashu DL : 0: 叉排序树与平衡二叉排序树基本操作的实现用二叉链表作存储结构 (1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Date : 2026-01-01 Size : 2kb User : 胡图
[Software Engineering] shuxingshiyanjiegou DL : 0: 1)熟练掌握二叉树的二叉链表表示及前序创建算法与实现； 2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现； 3）掌握中序遍历线索二叉树的基本算法与实现 4）掌握中序遍历线索化二叉树的算法与实现 -1) The master of the binary tree list and the former express order to create algorithms and realize 2) proficiency in the first tree order, in sequence and post-order recursive traversal algorithm and realization 3) in order to master clues to the basic binary tree traversal algorithm and realization of 4) have a good clue of binary tree traversal algorithms and realize
Date : 2026-01-01 Size : 27kb User : huiyuanyuan
[Software Engineering] tree DL : 0: 数据结构中树以及二叉树的基本操作以及算法,构造哈夫曼树以及模拟,带FLASH演示-Tree data structure and basic operations as well as the binary tree algorithm, Huffman tree structure, as well as simulation, with FLASH demo
Date : 2026-01-01 Size : 314kb User : nlx
[Software Engineering] Basedoncomputervisionharmfulinsectrecognitionengin DL : 0: 阐述了利用数学形态学法、二叉树法、人工神经网络等方法识别害虫的理论依据、研究情况及关键问题，指出了实现自动识别的前景及难点，以期促进该项技术在我国的应用。-Described the use of mathematical morphology method, binary tree method, artificial neural network methods such as the theoretical basis for pest identification, research and key issues, pointing out that to achieve automatic recognition of the prospects and difficulties, with a view to promoting the technology application in China.
Date : 2026-01-01 Size : 46kb User : 小米
[Software Engineering] ch06 DL : 0: 我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discuss the depth of the tree structure of two standard (tree structure), this chapter is to explain the binary search tree (binary search tree), as well as the next chapter to be discussed by the AVL balanced tree (AVL tree). Planting trees in these two data are arranged in order, the difference between them lies in a balanced AVL tree, binary search tree which are not.
Date : 2026-01-01 Size : 46kb User : 李南
[Software Engineering] ch07 DL : 0: 二元搜尋樹簡單易懂，不過有一個問題：它並非平衡樹。本章將介紹平衡的 AVL 搜尋樹，討論它的資料結構、函式，並設計程式使用它。 -Simple binary search tree, but there is a problem: it is not a balanced tree. This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and design program to use it.
Date : 2026-01-01 Size : 93kb User : 李南
[Software Engineering] tree DL : 0: 二叉树的创建、递归遍历算法及其它基本操作的实现-The creation of a binary tree, recursive traversal algorithm and the realization of other basic operations
Date : 2026-01-01 Size : 5kb User : 房春英
[Software Engineering] BinarySearchTree DL : 0: A binary search tree is a binary tree that is either empty or in which each node contains a key that satisfies the following conditions: 1) All keys (if any) in the left subtree of the root precede (are less than or equal to) the key of the root. 2) The key in the root precedes (is less than) all keys (if any) in its right subtree. 3) The left and right subtrees of the root are again binary search trees.
Date : 2026-01-01 Size : 65kb User : Rauahn
[Software Engineering] birary-treea-and-integer DL : 0: 这是我的一个笔试题，是把整数放到二叉树中的一个题发上来给大家看看（采用中序遍历）。希望对大家找工作有帮助-This is a pen test, is the integer into a binary tree in a title made up for everyone to see (in preorder traversal). People looking for work
Date : 2026-01-01 Size : 14kb User : 邢书语
[Software Engineering] Binary-Tree DL : 0: 对二叉树进行操作，包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
Date : 2026-01-01 Size : 2kb User : 莫失
[Software Engineering] elght DL : 0: Master different methods to find, and can be used to achieve high-level language search algorithm. 2, master and orderly sequence table lookup method tables. 3, master binary sort tree structure, search, insert, and delete methods
Date : 2026-01-01 Size : 2kb User : 流火学倩
[Software Engineering] 1 DL : 0: 对记录序列（查找表）：{55，13，23，72，109，67，2，78,13}分别实现如下操作： 1) 顺序查找； 3) 对排好序的纪录序列表进行折半查找； 4) 利用1）中记录序列建立一颗二叉排序树，并在其上实现特定关键字值结点的查找； 5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表； 6) 实现5）创建哈希表上的查找 -On the record sequence (lookup table): {} 55,13,23,72,109,67,2,78,13 were achieved as follows: 1) sequential search 3) sorted record sequence table binary search 4) Using 1) the establishment of a recorded sequence binary sort tree, and to achieve specific keywords to find the value of the node on which 5) Create a hash table of length m = 11 in accordance with the method of conflict management "in addition to leaving the remainder" linear probing hash constructor and re-hash 6) achieve 5) create a hash table lookup on
Date : 2026-01-01 Size : 8kb User : 潘珍
[Software Engineering] c-cpp DL : 0: (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
Date : 2026-01-01 Size : 1kb User : 胡馨月
[Software Engineering] Binary-search-tree-and-file- DL : 0: 进行二叉搜索树和文件操作的头文件binSearchTreeF.h,行二叉搜索树和文件操作的实现文件binSearchTreeF.c-Binary search tree and file operations
Date : 2026-01-01 Size : 9kb User : snow
[Software Engineering] Binary-Tree DL : 0: 关于二叉树先、中、后三种遍历的算法，以及对两棵二叉树进行判等的算法用c语言加以实现-About binary tree first, middle and last three traversal algorithms, and sentenced to two trees and other binary tree algorithm to be implemented in c language
Date : 2026-01-01 Size : 3kb User :
[Software Engineering] tree DL : 0: 这个程序是用C++语言对关于对二叉树内部路径长度的求解，实例中构造出二叉树并采用递归的方法得出结果。-This procedure is used C++ language regarding internal path length of a binary tree solving examples and construct a binary outcome using recursive method.
Date : 2026-01-01 Size : 1kb User : 赵金剑
[Software Engineering] SHUJUJIEGOU DL : 0: 本课程设中的二叉排序树，一共要实现四项基本的功能。它们分别是二叉顺序树的创建、中序遍历、查找结点和删除结点。-This course is set up in the binary sort tree to achieve a total of four basic functions. They are the creation of a binary tree sequence, the preorder, find nodes and delete nodes.
Date : 2026-01-01 Size : 178kb User : 佳佳
[Software Engineering] binary-tree DL : 0: Binary tree and its usage and how to build one
Date : 2026-01-01 Size : 295kb User : Lucky123
[Software Engineering] U201514766 DL : 0: 基于查找表的单词检索软件，设计与实现静态查找表、基于二叉排序树的动态查找表及HASH表等三种中的任意两种查找表结构及其抽象数据类型；以一本英文电子书（如英文小说，科普读物或圣经之类的社会书籍，书的篇幅不少于2万次单词）作为单词文本数据来源，使用上述查找表ADT，通过读取电子书而建立对应的两种查找表，以单词作为关键字，单词在书籍中出现的次数及每次出现的页码，行号等信息作为查找表数据元素属性；通过理论与实际测试结果对比分析两种查找表性能。(The design and implementation of static lookup table, based on the two binary sort tree dynamic lookup table and HASH table three in any two lookup table structure and abstract data types; one of the English books (such as English novels, such as social science books or Bible books, book of not less than 20 thousand words) as the word text data source, using the look-up table ADT, and set up two to find the corresponding table by reading books, with the word as a keyword, page number and each word in the book appear, line number and other information as a lookup table of data element attribute; by comparing the theoretical and practical analysis of the test results of two kinds of lookup table performance.)
Date : 2026-01-01 Size : 14.1mb User : aliiiim

« 12 »