Python Data Structure Dequeue A double-ended queue, or deque, supports adding and removing elements from either end. The more commonly used stacks and queues are degenerate forms of deques, where input and output are restricted to a single endpoint. Example…
Python Data Structures: Algorithm Analysis The efficiency of an algorithm can be analyzed at two different stages: before implementation and after implementation. These are the following: A priori Analysis – This is a theoretical analysis of an algorithm. Assuming all…
Python Advanced LinkedList We’ve already seen associative lists in the previous chapter, which only allow forward movement. In this chapter, we’ll see another type of linked list that allows both forward and backward movement. Such a linked list is called…
Python Data Structures: Backtracking Backtracking is a form of recursion. However, it simply involves selecting an option from among all the possibilities. We start by selecting an option, and if we reach a point where we believe that this particular…
Python Data Structures: Search Trees A binary search tree (BST) is a tree where all nodes have the following property: the key of a node’s left subtree is less than or equal to the key of its parent node, and…
Python Data Structure Environment Setup Python is available on a variety of platforms, including Linux and Mac OS X. Let’s learn how to set up our Python environment. Local Environment Setup Open a terminal window and type “python” to see…
Python Data Structures: Algorithm Proofs To claim that an algorithm is efficient, we need mathematical tools to prove it. These tools can help us provide a mathematically satisfactory explanation for the algorithm’s performance and accuracy. Below is a list of…
Python Data Structures: Lists A list is the most general data type in Python. It can be written as a list of comma-separated values (items) between square brackets. The important thing about lists is that the items don’t need to…
Python Data Structures: Queues We are familiar with queues in our daily lives because we wait for a service. The queue data structure is similar: data elements are arranged in a queue. The unique feature of a queue is the…
Python Data Structure Stack In English, the word stack means objects arranged one on top of another. In this data structure, memory is allocated in the same way. It stores data elements similarly to stacking dishes one on top of…