说明：  1．双向链表的插入 2．二叉树的先序遍历 3．图的深度优先搜索 4．折半查找 5．希尔排序
(1. Two-way linked list insertion 2. Binary tree traversal of the first 3. Figure 4 The depth-first search. Find half 5. Sort Hill)