ThinkerQAQ

栈

Data Structures & Algorithms · 3 notes

  1. Stack with a min Functionhistorical

    Record using an auxiliary minimum stack to retrieve the stack minimum in O(1) time.

  2. Stack Push and Pop Sequenceshistorical

    Record methods that use an auxiliary stack to determine whether a given sequence is a valid pop sequence.

  3. Implement a Queue with Two Stackshistorical

    Record how to implement queue Push, Pop, Peek, and Empty operations using two stacks.