3 docs tagged with "stack"

Given two linked lists that represent two numbers, return the sum of the numbers also represented as a list.

Given a binary tree, return a list containing its inorder traversal without using recursion.

Design a class to implement a stack using only a single queue. Your class, QueueStack, should support the following stack methods: push() (adding an item), pop() (removing an item), peek() (returning the top value without removing it), and empty() (whether or not the stack is empty).