PTA 03-树3 Tree Traversals Again
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the s...
原创
2017-10-13 17:40:35 ·
508 阅读 ·
0 评论