Skip to Content
C++ Data Structures and Algorithms
book

C++ Data Structures and Algorithms

by Wisnu Anggoro
April 2018
Intermediate to advanced content levelIntermediate to advanced
322 pages
6h 57m
English
Packt Publishing
Content preview from C++ Data Structures and Algorithms

Fetching the item's value in the Stack ADT

In the Stack data type, we can only get the value of the top node. Thus, the Top() operation will show the value of the m_top node. The implementation of this operation is simple, as we can see in the following code snippet:

template <typename T>T Stack<T>::Top(){    // Just return the value    // of m_top node    return m_top->Value;}

As we can see, the operation just returns the value of m_top so that, no matter how many items there are in Stack, the complexity of this operation is O(1) for both the best case and worst case scenario. And don't forget to invoke the IsEmpty() method prior to the invocation of the Top() operation. We should not invoke the Top() operation if there's no item in Stack since it ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures and Algorithms Using C++

Data Structures and Algorithms Using C++

Ananda Rao Akepogu, Radhika Raju Palagiri
C++ Data Structures and Algorithm Design Principles

C++ Data Structures and Algorithm Design Principles

John Carey, Anil Achary, Shreyans Doshi, Payas Rajan
C++ Plus Data Structures, 6th Edition

C++ Plus Data Structures, 6th Edition

Nell Dale, Chip Weems, Tim Richards

Publisher Resources

ISBN: 9781788835213Supplemental Content