Book Image

Hands-On Data Structures and Algorithms with Python - Third Edition

By : Dr. Basant Agarwal
Book Image

Hands-On Data Structures and Algorithms with Python - Third Edition

By: Dr. Basant Agarwal

Overview of this book

Choosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You’ll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer. By the end of this Python book, you’ll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications.
Table of Contents (17 chapters)
14
Other Books You May Enjoy
15
Index

Exercises

  1. What will be the time complexity for deleting an arbitrary element from the min-heap?
  2. What will be the time complexity for finding the kth smallest element from the min-heap?
  3. What will be the worst-case time complexity for ascertaining the smallest element from a binary max-heap and binary min-heap?
  4. What will be the time complexity to make a max-heap that combines two max-heap each of size n?
  5. The level order traversal of max-heap is 12, 9, 7, 4, and 2. After inserting new elements 1 and 8, what will be the final max-heap and the level order traversal of the final max-heap?
  6. Which of the following is a binary max-heap?
Diagram  Description automatically generated
Diagram  Description automatically generated

Figure 7.21: Example trees

Join our community on Discord

Join our community’s Discord space for discussions with the author and other readers: https://packt.link/MEvK4