Data_Structures_Python

Creating ADT Data Strcutures In Python

singlyLinkedList.py :

This program creates a singly linked list and also has a menu to modify that list with seven options:

1. Add Element (Tail Position)
2. Add Element (Positioned)
3. Add Header
4. Delete Header
5. Delete Element (Positioned)
6. Get Data (Positioned)
7. Change Data (Positioned)

With every option chosen, the list gets updated and diplays its content, along with its current length.

list_merger.py :

This program creates two dummy unordered linked lists and then merges them to create a ordered merged linked list while taking new inputs from the menu into the dummy list one or two and continuously updating both the unordered lists and the ordered merged list.

doublyLinkedList.py :

This program creates a doubly linked list with the following options:

1. Add Element (Tail Position)
2. Get Data
3. Left Right Traverse Through List

With every option chosen, the list gets updated and diplays its content, along with its current length. If option three is choosen, we can traverse throughtout the doubly linked list, both to its left or right.

stackArrayImplementation.py :

This program creates an array implemented stack by taking the stack capacity/size as an input and displaying the current stack along with the following options to modify the stack:

1. Push Data
2. Pop Data
3. Stack Current Size
4. Stack Top Value
5. Stack Base Value
6. Stack Memory Information

queueLinkedListImplementation.py :

This program creates a linked list implemented queue by taking new data as input while displaying the current queue. The queue can be modified by the following function:

1. EnQue
2. DeQue

EnQue means adding new data to the queue, while Deque means removing data from the queue accordingly.

binarySearchTree.py :

This program creates a binary search tree by adding new elements into the tree from the use input while displaying the tree in 2 different ways:

• Tree Level Display (Default)
• Data Left Right Display