Search - binary AND tree

Search - binary AND tree - List

[Linux-Unix] pingheng DL : 0: 输入字符，建立平衡二叉树，再输出字符，中序，抛砖引玉-input characters, the establishment of balanced binary tree, and the output of characters, sequence, something
Date : 2008-10-13 Size : 883byte User : 雷阵雨
[Linux-Unix] dancitongji DL : 0: 对读入的某个文本文件input.txt中，拆出英文单词，输出一个按字典顺序排列的单词表，结果输出在文本文件output.txt中，每个单词一行，并在单词后输出该单词出现的个数，两个字段之间用逗号分隔。约定单词仅由英文字母组成，单词间由非英文字母分隔，相同单词只输出一个，大小写不区分。利用二叉树实现-the right time to a text file input.txt, divestment English words, Output by an order of the dictionary word list, the result output in a text file output.txt. Every word here, and the output of the word after word of the number, between two fields separated by a comma. Agreed only by the words in alphabetical composition, word by non-alphabetic segregation, the same word is only one output, distinction is not case. Achieved using binary tree
Date : 2008-10-13 Size : 40.05kb User : 李剑
[Linux-Unix] common101 DL : 0: The UCL common multimedia library implements a number of algorithms and protocols needed by a number of our applications. It compiles standalone on a range of Unix systems (Solaris, Linux, Irix, FreeBSD, MacOSX) and on Windows 95/98/NT/XP. The following protocols/algorithms are included in the library: Base64 encoding/decoding Binary tree Random number HMAC authentication MD5 DES RTP MBus SAP
Date : 2008-10-13 Size : 297.94kb User : 王毅
[Linux-Unix] pingheng DL : 0: 输入字符，建立平衡二叉树，再输出字符，中序，抛砖引玉-input characters, the establishment of balanced binary tree, and the output of characters, sequence, something
Date : 2026-01-01 Size : 1kb User : 雷阵雨
[Linux-Unix] dancitongji DL : 0: 对读入的某个文本文件input.txt中，拆出英文单词，输出一个按字典顺序排列的单词表，结果输出在文本文件output.txt中，每个单词一行，并在单词后输出该单词出现的个数，两个字段之间用逗号分隔。约定单词仅由英文字母组成，单词间由非英文字母分隔，相同单词只输出一个，大小写不区分。利用二叉树实现-the right time to a text file input.txt, divestment English words, Output by an order of the dictionary word list, the result output in a text file output.txt. Every word here, and the output of the word after word of the number, between two fields separated by a comma. Agreed only by the words in alphabetical composition, word by non-alphabetic segregation, the same word is only one output, distinction is not case. Achieved using binary tree
Date : 2026-01-01 Size : 40kb User : 李剑
[Linux-Unix] common101 DL : 0: The UCL common multimedia library implements a number of algorithms and protocols needed by a number of our applications. It compiles standalone on a range of Unix systems (Solaris, Linux, Irix, FreeBSD, MacOSX) and on Windows 95/98/NT/XP. The following protocols/algorithms are included in the library: Base64 encoding/decoding Binary tree Random number HMAC authentication MD5 DES RTP MBus SAP -The UCL common multimedia library implements a number of algorithms and protocols needed by a number of our applications. It compiles standalone on a range of Unix systems (Solaris, Linux, Irix, FreeBSD, MacOSX) and on Windows 95/98/NT/XP . The following protocols/algorithms are included in the library: Base64 encoding/decoding Binary tree Random number HMAC authentication MD5 DES RTP MBus SAP
Date : 2026-01-01 Size : 298kb User : 王毅
[Linux-Unix] txt DL : 0: 用二叉链表做存储结构，输入键值序列，建立一棵二叉排序树并在二叉排序树上实现查找算法。-To do with binary storage structure list, enter the key sequence, set up a binary sort tree and binary search algorithm to sort the tree implementation.
Date : 2026-01-01 Size : 3kb User : wangya
[Linux-Unix] avl DL : 0: 平衡排序二叉树的具体实现及使用测试例子在linux上测试通过-Order to achieve a balanced binary tree and the use of specific test cases to test in linux through
Date : 2026-01-01 Size : 2kb User : jinyunshuai
[Linux-Unix] kyotocabinet-java-1.14.tar DL : 0: 这是 kyoko cabinet C 代码有关 Java 的绑定接口。 kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。 -Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree. The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternative for the DBM because of its higher performance. Each operation of the hash database has the time complexity of "O(1)". Therefore, in theory, the performance is constant regardless of t
Date : 2026-01-01 Size : 103kb User : Jim Abuma
[Linux-Unix] tokyocabinet-lua-1.10.tar DL : 0: Tokyo cabinet C 库的Lua绑定接口。 Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
Date : 2026-01-01 Size : 109kb User : Jim Abuma
[Linux-Unix] tokyocabinet-ruby-1.31.tar DL : 0: Tokyo cabinet C 库的 Ruby绑定代码API Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
Date : 2026-01-01 Size : 96kb User : Jim Abuma
[Linux-Unix] kyotocabinet-lua-1.13.tar DL : 0: 这是 kyoko cabinet C 库的Lua语言绑定的API接口。 kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。-Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree. The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternative for the DBM because of its higher performance. Each operation of the hash database has the time complexity of "O(1)". Therefore, in theory, the performance is constant regardless of t
Date : 2026-01-01 Size : 91kb User : Jim Abuma
[Linux-Unix] kyotocabinet-perl-1.11.tar DL : 0: 这是 kyoko cabinet C语言库代码 Perl 的绑定接口。 kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。 -This perl library wraps the polymorphic database of the C++ API. So, you can select the internal data structure by specifying the database name in runtime. This library is thread-safe. Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree. The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternativ
Date : 2026-01-01 Size : 39kb User : Jim Abuma
[Linux-Unix] kyotocabinet-python-1.14.tar DL : 0: 这是 kyoko cabinet C语言库代码 Python 的绑定接口。 kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。 -This Python library wraps the polymorphic database of the C++ API. So, you can select the internal data structure by specifying the database name in runtime. This library is thread-safe. Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree. The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternat
Date : 2026-01-01 Size : 65kb User : Jim Abuma
[Linux-Unix] tokyocabinet-perl-1.34.tar DL : 0: Tokyo cabinet C库的Perl绑定代码API。 Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
Date : 2026-01-01 Size : 59kb User : Jim Abuma
[Linux-Unix] abstract-data-types DL : 0: In this homework, we are going to implement various ADTs including “doubly linked list”, “dynamic array” and “binary search tree”. Based on the parameter to the “make” command, we will generate 3 different executables: “adtTest.dlist”, “adtTest.array”, and “adtTest.bst”, representing the test programs for the “doubly linked list”, “dynamic array” and “binary search tree”, respectively.
Date : 2026-01-01 Size : 113kb User : tingyu chen
[Linux-Unix] chanage_ctree DL : 0: 在qt/Linux都能跑,主要使用平衡二叉树实现高效读写配置文件-In qt/Linux can run, Ping Heng binary tree is mainly used for efficient read and write configuration file
Date : 2026-01-01 Size : 7kb User : Carl