Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Everyday data structures

You're reading from   Everyday data structures A practical guide to learning data structures simply and easily

Arrow left icon
Product type Paperback
Published in Mar 2017
Publisher Packt
ISBN-13 9781787121041
Length 344 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
William Smith William Smith
Author Profile Icon William Smith
William Smith
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Data Types: Foundational Structures FREE CHAPTER 2. Arrays: Foundational Collections 3. Lists: Linear Collections 4. Stacks: LIFO Collections 5. Queues: FIFO Collections 6. Dictionaries: Keyed Collections 7. Sets: No Duplicates 8. Structs: Complex Types 9. Trees: Non-Linear Structures 10. Heaps: Ordered Trees 11. Graphs: Values with Relationships 12. Sorting: Bringing Order Out Of Chaos 13. Searching: Finding What You Need

Summary


In this chapter, we learned about heap data structures. We examined the most common operations when working with heaps and their complexity cost. Following this we created our own simple min heap data structure class from scratch, and discussed how the min heap property formula is used to calculate parents or children for any given node index. Finally, we examined the most common applications for heap data structures.

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 ₹800/month. Cancel anytime