摘要: 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 阅读全文
posted @ 2017-12-15 16:09 gaoren 阅读(140) 评论(0) 推荐(0)