2019年4月16日
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 阅读全文
posted @ 2019-04-16 00:27 jiamian22 阅读(158) 评论(0) 推荐(0)
List Leaves
摘要： Given a tree, you are supposed to list all the leaves in the order of top down, and left to right. Input Specification: Each input file contains one t 阅读全文
posted @ 2019-04-16 00:23 jiamian22 阅读(157) 评论(0) 推荐(0)