Python Data Structures

Linear: A data structure is said to be linear if its elements form a sequence or a linear list. Examples: Array. Linked List, Stacks and Queues.

Non-Linear: A data structure is said to be non-linear if traversal of nodes is nonlinear in nature. i.e, These are the data structures in which there is no sequential linking of data elements. Any pair or group of data elements can be linked to each other and can be accessed without a strict sequence. Example: Graph and Trees.

Array: It is a sequential arrangement of data elements paired with the index of the data element.

Linked List: Each data element contains a link to another element along with the data present in it.

Stack: It is a data structure which follows only to specific order of operation. LIFO(last in First Out) or FILO(First in Last Out).

Queue: It is similar to Stack but the order of operation is only FIFO(First In First Out).

Matrix: It is two dimensional data structure in which the data element is referred by a pair of indices.

Binary Tree: It is a data structure where each data element can be connected to maximum two other data elements and it starts with a root node.

Heap: It is a special case of Tree data structure where the data in the parent node is either strictly greater than/ equal to the child nodes or strictly less than it’s child nodes.

Hash Table: It is a data structure which is made of arrays associated with each other using a hash function. It retrieves values

using keys rather than index from a data element.

Graph: It is an arrangement of vertices and nodes where some of the nodes are connected to each other through link.

List: It is similar to array with the exception that the data elements can be of different data types. You can have both numeric and string data in a python list.

Tuple: Tuples are similar to lists but they are immutable which means the values in a tuple cannot be modified they can only be read.

Dictionary: The dictionary contains Key-value pairs as its data elements.

empty() – Returns whether the stack is empty.

size() – Returns the size of the stack.

top() – Returns a reference to the top most element of the stack.

push(g) – Adds the element ‘g’ at the top of the stack.

pop() – Deletes the top most element of the stack.

Using Array

Using Linked List