Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Data Structures and Algorithms with Kotlin

You're reading from   Hands-On Data Structures and Algorithms with Kotlin Level up your programming skills by understanding how Kotlin's data structure works

Arrow left icon
Product type Paperback
Published in Feb 2019
Publisher Packt
ISBN-13 9781788994019
Length 220 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Chandra Sekhar Nayak Chandra Sekhar Nayak
Author Profile Icon Chandra Sekhar Nayak
Chandra Sekhar Nayak
Rivu Chakraborty Rivu Chakraborty
Author Profile Icon Rivu Chakraborty
Rivu Chakraborty
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Section 1: Getting Started with Data Structures
2. A Walk Through - Data Structures and Algorithms FREE CHAPTER 3. Arrays - First Step to Grouping Data 4. Section 2: Efficient Grouping of Data with Various Data Structures
5. Introducing Linked Lists 6. Understanding Stacks and Queues 7. Maps - Working with Key-Value Pairs 8. Section 3: Algorithms and Efficiency
9. Deep-Dive into Searching Algorithms 10. Understanding Sorting Algorithms 11. Section 4: Modern and Advanced Data Structures
12. Collections and Data Operations in Kotlin 13. Introduction to Functional Programming 14. Other Books You May Enjoy 15. Assessments

Operations on a stack

As mentioned earlier, a stack allows you to do an operation only with the last index. So, the operations possible on a stack are as follows:

  • Insertion: This allows you to insert an element at last index (Top) of the stack. This operation is also called a Push operation.
  • Deletion: This allows you to delete the element at last index (Top) of the stack. This operation is also called a Pop operation.

In addition to these primary operations, the stack can also allow a few secondary operations, such as the following:

  • Fetch: Fetches the top of the stack, also called Peek
  • Size: Returns the size of the stack
  • isEmpty: Tells whether the stack is empty or not
  • isFull: Tells whether the stack is full or not

If we closely observe the operations it allows us to do, we'll notice that the element that is being inserted (Push) last is deleted and (Pop) first. On the...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image