Description: 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.
To Search:
File list (Check if you may need any files):
实验三 .doc
Download