Data structure and algorithm learning 1th season 03 Stack Queue tree Chart

2015 Study Plan Arrangement:

Http://www.cnblogs.com/cyrus-ho/p/4182275.html

Stack: Linear table for LIFO

Queue: Linear table of FIFO

Tree: (recursive definition) n nodes have a poor set, to a non-empty tree, there is only one node called the root, n>1, the remaining nodes are divided into M-disjoint finite sets, and each set itself is a tree, and is called the root subtree

Figure: An organizational structure in which relationships can exist between any two data elements

Binary tree storage: Data structures that can be selected with multiple lists

Traversal of a binary tree: First order, sequence, post order

Storage of graphs: adjacency matrices (not suitable for storing sparse graphs) and adjacency tables

Graph traversal: Depth-First search (DFS) and breadth-first search (BFS)

Data structure and algorithm learning 1th season 03 Stack Queue tree Chart