The Open Source Swiss Army Knife
|
|||||
| | |||||
| sub-categories and articles | ||
 dataStructures_c |
add | |
| dataStructures_cPP |
add | |
| --->create new sub-category | ||
 Ttrees.txt | ||
| add
Like AVL trees, the height of left and right subtrees of a T-tree may differ by at most one. Unlike AVL trees, each node in a T-tree stores multiple key values in a sorted order, rather than a single key value. The left-most and the right-most key value in a node define the range of key values contained in the node. Thus, the left subtree of a node contains only key values less than the left-most key value, while the right subtree contains key values greater than the right-most key value in the node. A key value which is falls between the smallest and largest key values in a node is said to be bounded by that node. Note that keys equal to the smallest or largest key in the node may or may not be considered to be bounded based on whether the index is unique and based on the search condition (e.g. "greater-than" versus "greater-than or equal-to"). source: http://www.ispras.ru/~knizhnik/post/readme.htm | ||
| binary_trees.txt | ||
add
trees of all kinds | ||
| bst_2-3trees.txt | ||
| binary search trees: 2-3 trees
2-3 TREES ========= A 2-3 tree is a tree that can have nodes of two kinds: 2-nodes and 3-nodes. a 2-node is what I've gotten familiar with as the normal kind of node. A 3-node is where there are simply 3 children each which has children. Oh man, too hard stuff. They come up with this stuff just to torture poor students like myself | ||
| bst_avl.txt | ||
| specifically, the avl tree specifics of this kind of binary search tree
AVL TREES ========= The requirement that it has nowhere height difference greater than two. The above check is made for every node. Check the right and left branches. Then you will have to assign that node either a 0, 1 or -1 in order for that tree to be called an AVL tree. If there is no difference between the left and right subtrees,that node gets a value of 0. I don't know why a -1 is used. I understand 0 and 1 but how can the difference between a right and left node be -1? | ||
| graphs.txt | ||
add
graphs
| ||
| hashing.txt | ||
| add
HASHING ======= *hashing* is an idea of using a *hash table* (a one-dimensional array) to hold the keys of the elements. The keys are distributed in accordance with a *hash function* and put in *hash addresses*. hashes are important because they are O(1) for searching as opposed to binary | ||
| heaps.txt | ||
| heaps and heapsort
PRIORITY QUEUES =============== The priority is used for: 1. finding an item with the highest priority | ||
| --->upload your article | ||
User submitted category site links |
||
(None) | ||
-->submit a page from your site dealing with dataStructures to the sirfsup! web directory for listing | ||