8.2.3利用子指针数组的普通树后根遍历算法-8.2.3 the use of common sub-tree pointer array root traversal algorithm

实现约瑟夫，he structure has two members, one for pointing down a pointer to a circular chain Second, if person be thrown off the mark, for 1 "in the boat. From the first man began to have not dropped the sea of the count, each count to 9, will mark the st

主要是实现贪吃蛇的蛇身逐步运动，采用结构数组和结构指针，再用easyx图形库进行绘图。-to achieve the progressive movement, using an array of structures and structure pointer, then using easyx graphics library for drawing.