yeternity的博客

Given a stack which can keep MM numbers at most. Push N numbers in the order of 1, 2, 3, ...,N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop seque

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 stac