建立一棵链表表示的二叉树，然后采用非递归先序访问二叉树，具体用一个指针栈(数组)来实现，且其最大容量为maxsize=50，二叉树根指针为T，若一个结点的左孩子和右孩子均为空，则为叶子结点，计数器加一，直到访问结束。-Binary tree expressed in the establishment of a linked list, and then visit the first-order non-recursive binary tree, specifically with a pointer to the stack (array) to achieve, and its maximum capacity of maxsize = 50, a binary tree the root pointer for the T If a node' s left child and right child are empty, for the leaf nodes, the counter plus one, until the end of the visit.