数据结构中关于单链表的算法,将两个链表有序链合并成一个非递归有序的单链表,并不占用其他的存储空间,data structure of single-chain algorithm Listless and orderly of the two chains merged into a non- recursive and orderly single linked list, does not occupy other storage space

构造一个图，至少有四个结点，实现图的非递归深度优先遍历，存储、初始化也包括在内。-Construct a map, at least four nodes, to achieve non-recursive depth-first traversal, the memory, the initialization is also included.