Some examples. They’re vague because they were work for employers: A heap to get the top N results in a Google-style search. (Starting from candidates in an index, go through them all linearly, sifting them through a min-heap of max size N.) This was for an image-search prototype. Bloom filters cut the size of certain … Read more
AVL trees are intended for in-memory use, where random access is relatively cheap. B-trees are better suited for disk-backed storage, because they group a larger number of keys into each node to minimize the number of seeks required by a read or write operation. (This is why B-trees are often used in file systems and … Read more
I ROOT (root is also an INTERNAL NODE, unless it is leaf) / \ I I INTERNAL NODES / / \ o o o EXTERNAL NODES (or leaves) As the wonderful picture shows, internal nodes are nodes located between the root of the tree and the leaves. Note that the root is also an internal … Read more
It means that your program code you write is also data which can be manipulated by a program. Take a simple Scheme expression like (+ 3 (* 6 7)) You can regard it as a mathematical expression which when evaluated yields a value. But it is also a list containing three elements, namely +, 3 … Read more
‘(A (B (D) (E)) (C (F)))
A red/black tree is more or less equivalent to a 2-3-4 tree, which is just a type of B-tree. The worst-case performance is identical, provided you do a binary search of the B-tree node values. The obvious disadvantage of a B-tree is wasted space, but depending on the language/memory allocator used, you may find that … Read more
In a pure functional language, a doubly-linked list is not that interesting. The idea of a doubly linked list is to be able to grab a node and go in either direction, or to be able to splice into the middle of a list. In a pure functionaly language you probably are better off with … Read more
Computer Networks: Graphs model intuitively model computer networks and the Internet. Often nodes will represent end-systems or routers, while edges represent connections between these systems. Data Structures: Any data structure that makes use of pointers to link data together is making use of a graph of some kind. This includes tree structures and linked lists … Read more
On good old ZX-Spectrum one (or more, I do not know) text exditor used very simple structure. There was one big buffer, which occupied all free RAM. Text was split in two parts at the cursor. Part before the cursor, was placed at the beginning of the buffer, and the rest at the end of … Read more
Dense graph is a graph in which the number of edges is close to the maximal number of edges. Sparse graph is a graph in which the number of edges is close to the minimal number of edges. Sparse graph can be a disconnected graph.