Skip to content

Added "peek" function for QueueUsingTwoStacks #282

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 27, 2017
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions Others/QueueUsingTwoStacks.java
Original file line number Diff line number Diff line change
Expand Up @@ -55,6 +55,21 @@ public Object remove() {
return this.outStack.pop();
}

/**
* Peek at the element from the front of the queue
*
* @return the new front of the queue
*/
public Object peek() {
if(this.outStack.isEmpty()) {
// Move all elements from inStack to outStack (preserving the order)
while(!this.inStack.isEmpty()) {
this.outStack.push( this.inStack.pop() );
}
}
return this.outStack.peek();
}

/**
* Returns true if the queue is empty
*
Expand Down Expand Up @@ -101,18 +116,24 @@ public static void main(String args[]){
// outStack: [(top) 2, 3, 4]

myQueue.insert(5);
System.out.println(myQueue.peek()); //Will print 2
// instack: [(top) 5]
// outStack: [(top) 2, 3, 4]

myQueue.remove();
System.out.println(myQueue.peek()); //Will print 3
// instack: [(top) 5]
// outStack: [(top) 3, 4]
myQueue.remove();
System.out.println(myQueue.peek()); //Will print 4
// instack: [(top) 5]
// outStack: [(top) 4]
myQueue.remove();
// instack: [(top) 5]
// outStack: []
System.out.println(myQueue.peek()); //Will print 5
// instack: []
// outStack: [(top) 5]
myQueue.remove();
// instack: []
// outStack: []
Expand Down