链表结点二叉树实现,通过建立树和遍历树,真正实现二叉树的树状显示,根结点在最上面,用c实现,通过计算结点位置放置结点.需要的可以参考!-Binary Tree node list, through the establishment of trees and tree traversal, binary tree truly show the root node at the top, with c achieved by calculating the node position to pla

打印二叉树，在学习数据结构方面有一定的帮助，同时在打印二叉树时能够真实的体会到二叉树的原理-Print binary tree data structure in the study have some help, but when printing a binary tree can truly appreciate the principle of a binary tree