data structures

From Noah.org
Revision as of 11:21, 29 July 2015 by Root (Talk | contribs) (Created page with 'Category: Engineering Lowest Common Ancestor = Data Structures = ;Linked List: ;Stack: ;Queue: ;Heap: ;Priority Queue: ;Union Find: ;Hash Table: ;Tree Map: ;Suffix Array: …')

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


Lowest Common Ancestor

Data Structures

Linked List
Stack
Queue
Heap
Priority Queue
Union Find
Hash Table
Tree Map
Suffix Array
Dynamic Suffix Array
Sparse Table
Lowest Common Ancestor
Suffix Automaton
Heavy-Light Decomposition
Aho-Corasick
string searching algorithm:
Rope
data structure that uses a tree to store a string in order to make subsequent manipulation of the string more efficient. This data structure is frequently found in text editors and makes it possible to efficiently delete and insert blocks of text.
Dancing Links
Used to solve exact cover problems.

Trees

Binary Search Tree
Huffman Tree
Segment Tree
Binary Indexed Tree
Range Tree
Trie (prefix tree)
Radix Tree
K-d tree
Link-Cut Tree
Splay Tree
Palindromic Tree
Treap
randomized binary tree (heap + tree + heap)