Turn: Data structure and algorithm series

Originally from: http://www.cnblogs.com/skywang12345/p/3603935.html

Recently took time to collate the "data structure and algorithm" related articles. In the finishing process, for each data structure and algorithm to give the "C", "C + +" and "Java" the implementation of the three languages, the implementation of the language is different, but the principle is the same. Therefore, the reader in the process of understanding and learning, choose one of them!

The following is the collation of data and algorithms of the table of contents, for each kind according to C/c++/java division, convenient to consult. If there are errors or omissions in the article, please do not hesitate to correct me. Thank you!

data structure and algorithm catalog table

	C	C++	Java
Linear structure	1. Arrays, single-linked lists and doubly linked lists 2. The classic implementation of the bidirectional linked list in the Linux kernel	Arrays, single-linked lists, and double-linked lists	Arrays, single-linked lists, and double-linked lists
	Stack	Stack	Stack
	Queue	Queue	Queue
Tree-shaped structure	Binary search Tree	Binary search Tree	Binary search Tree
	AVL Tree	AVL Tree	AVL Tree
	Stretching tree	Stretching tree	Stretching tree
	1. The principle and algorithm of red-black tree (i) Detailed introduction 2. Red and Black Tree (ii) The realization of C language 3. Red-Black Tree (iii) The classic implementation of red and black trees in the Linux kernel 4. References to red and black trees (vi)	1. The principle and algorithm of red-black tree (i) Detailed introduction 2. Implementation of C + + for Red and black Trees (iv) 3. References to red and black trees (vi)	1. The principle and algorithm of red-black tree (i) Detailed introduction 2. The implementation of Java in red-black tree (v) 3. References to red and black trees (vi)
	Huffman Tree	Huffman Tree	Huffman Tree
	...
Heap	Two-fork Pile	Two-fork Pile	Two-fork Pile
	Left-leaning heap	Left-leaning heap	Left-leaning heap
	Oblique heap	Oblique heap	Oblique heap
	Two-item heap	Two-item heap	Two-item heap
	Fibonacci Heap	Fibonacci Heap	Fibonacci Heap
	...
Figure	The theoretical basis of graphs	The theoretical basis of graphs	The theoretical basis of graphs
	1. adjacency matrix non-direction graph 2. adjacency Table No-map 3. Adjacency matrix with Direction graph 4. adjacency table to map	1. adjacency matrix non-direction graph 2. adjacency Table No-map 3. Adjacency matrix with Direction graph 4. adjacency table to map	1. adjacency matrix non-direction graph 2. adjacency Table No-map 3. Adjacency matrix with Direction graph 4. adjacency table to map
	Depth-first search and breadth-first search	Depth-first search and breadth-first search	Depth-first search and breadth-first search
	Topological sorting	Topological sorting	Topological sorting
	Kruskal algorithm	Kruskal algorithm	Kruskal algorithm
	Prim algorithm	Prim algorithm	Prim algorithm
	Dijkstra algorithm
	...
Sorting algorithms	Bubble sort	Bubble sort	Bubble sort
	Quick Sort	Quick Sort	Quick Sort
	Direct Insert Sort	Direct Insert Sort	Direct Insert Sort
	Hill sort	Hill sort	Hill sort
	Select sort	Select sort	Select sort
	Heap Sort	Heap Sort	Heap Sort
	Merge sort	Merge sort	Merge sort
	Bucket sort	Bucket sort	Bucket sort
	Base sort	Base sort	Base sort
	...

Turn: Data structure and algorithm series