04 2021 档案

树3 Tree Traversals Again 代码
摘要：03-树3 Tree Traversals Again (25 分) An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that 阅读全文
posted @ 2021-04-25 23:22 柚子z 阅读(98) 评论(0) 推荐(0)
Pop Sequence 题解 代码 心得
摘要：Pop Sequence 题面 Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to t 阅读全文
posted @ 2021-04-14 15:08 柚子z 阅读(97) 评论(0) 推荐(0)