Datastax

- Refactored Array Contents
- Added AbstractArray SubModule to abstract print logic
- Added more test cases for Queues
- Type Checked Arrays and Lists with mypy

- Refactored linkedlists -> Lists
- Refactored arrays -> Arrays
- Refactored private_lists -> AbstractLists
- Refactored AbstractLists by converting all items to AbstractClass to prevent direct initialization.
- Module Conventions converted to uppercase CamelCase from lowercase snake_case

- Fixed ModuleNotFoundError for private directories
- Added Strict keyword args for Arrays, Threaded Binary Tree
- Added HQ PNGs in README.md

- Added Sum Segment Tree
- Added Min Segment Tree
- Added Huffman Tree
- data encoder
- data decoder
- Huffman Code
- Huffman Table
- compression ratio
- space saved
- Added Red Black Tree - 🗸 TESTED
- Added Splay Tree - 🗸 TESTED
- Added Delete methods in: 🗸 TESTED
- BinaryTree
- BinarySearchTree
- AVLTree
- Enhanced string representation of all LinkedLists
- Added Custom Comparator for PriorityQueue
- Added name-mangler function for items with multiline string representations
- Added HuffmanTable object for storing and visualizing huffman-table

- Implemented Proper tests with Unit Test and Pytest
- Tested Arrays
- Tested LinkedLists
- Tested Trees
- Added Expression Tree
- Added Threaded Binary Tree
- Added Insertion logic parameter
- Linted with flake8.
- Added Search Functionality for BST and AVLT

PreRelease
- Included Priority Queue
- Replaced Bad Implementation of max heap with arrays to true tree implementation, fixes 4
- Added Proper MinHeap DataStructure
- Added proper OverFlow and UnderFlow Errors for stack and queues
Thanks to [hariuserx](https://github.com/hariuserx/MinHeap) for his [stackOverflow comment](https://stackoverflow.com/a/55077434)