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)
Other Books You May Enjoy


  1. Which of the following is a true about binary trees:
    1. Every binary tree is either complete or full
    2. Every complete binary tree is also a full binary tree
    3. Every full binary tree is also a complete binary tree
    4. No binary tree is both complete and full
    5. None of the above
  2. Which of the tree traversal algorithms visit the root node last?

    Consider this binary search tree:

Figure 6.38: Sample binary search tree

  1. Suppose we remove the root node 8, and we wish to replace it with any node from the left subtree, then what will be the new root?
  2. What will be the inorder, postorder and preorder traversal of the following tree?

Figure 6.39: Example tree

  1. How do you find out if two trees are identical?
  2. How many leaves are there in the tree mentioned in question number 4?
  3. What is the relation between a perfect binary tree’s height and the...