1.以邻接表作存储结构，编写深度优先、广度优先的算法。

2、以邻接表作存储结构，编写最小生成树的算法。

3、以邻接表作存储结构，编写最短路径的算法。

1.以邻接表作存储结构，使用非递归方式编写深度优先、广度优先的算法。

-Adjacency list storage structure, writing depth first, breadth-first algorithm.

2 adjacency list storage structure, the preparation of the minimum spanning tree algorithm.

3 to the adjacent table storage structure, the to write shortest path algorithm.

Adjacency list storage structure, written in non-recursive depth-first and breadth-first algorithm. A binary list storage structure, written preamble, inorder, postorder and level order traversal of a binary tree algorithm.

2 binary linked list storage structure, written to calculate the binary tree depth, the total number of all nodes, leaf nodes, the number of two-child node, the number of single-child node algorithm

Preorder, inorder, postorder and level order traversal of a binary tree algorithm non-recursive (stack or queue)