Search - binary AND tree

Search - binary AND tree - List

[Database system] tokyocabinet-1.4.17.tar DL : 0: Tokyo Cabinet的Tokyo Cabinet 是一个DBM的实现。这里的数据库由一系列key-value对的记录构成。key和value都可以是任意长度的字节序列,既可以是二进制也可以是字符串。这里没有数据类型和数据表的概念。作者叫Mikio Hirabayashi.Tokyo Cabinet是用C写的，同时提供c,perl,ruby,java的API。Tokyo Cabinet在提供了POSIX和C99的平台上都可用，它以GNU Lesser Public License协议发布。-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.Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, Java, and Lua. Tokyo Cabinet is available on platforms which have API conforming to C99 and POSIX. Tokyo Cabinet is a free software licensed under the GNU Lesser General Public License.
Date : 2026-01-01 Size : 873kb User : ws
[Database system] 4 DL : 0: 1. 建立自己的头文件BT.H，内容包括二叉链表的结构描述、二叉树的建立、二叉树的先序、中序与后序遍历算法。 2. 建立二叉树,并通过调用函数,，输出先序遍历、中序遍历与后序遍历的结果。 -1. To establish their own header files BT.H, including the structure of linked list binary description of the establishment of binary tree, binary tree of the first order, in sequence and after the traversal algorithm. 2. The establishment of tree, and by calling the function, the output first traversal, in and after the traversal traversal results.
Date : 2026-01-01 Size : 9kb User : zhang