Data Structures in Python.
Project description
ToyData: Learning Data Structures with toy code
There are some simple implementations(in Python3.7.6) of classic data structrues.
I am trying to do this with an easy-to-read style.
And, I add some extra functions beyond the ADTs, which are used mostly for printing and testing purposes.
Books
Data Structures and Algorithms in Python, Michael T. Goodrich is the main reference of the implementations.
Note that there is a book named Data Structures and Algorithms in C++, Michael T. Goodrich which use C++ to implement these data structures.
And Data Structures Using C, Reema Thareja is also a great book that implement these data structures using C.
Documentation
API
- Stack: ArrayStack, LinkedStack
- Queue: ArrayQueue, ArrayDeque
- Deque: LinkedDeque
- Positional List: PositionalList
- Prority Queues: UnsortedPriorityQueue, SortedPriorityQueue, HeapPriorityQueue
- LinkedLists: Singlellist, Doublellist
- Hash Tables: ChainHashMap, ProbeHashMap, SortedTableMap
- Trees: LinkedBinaryTree
- Search Trees: AVLTreeMap, SplayTreeMap, RedBlackTreeMap
- Graph: Adjacency Map, DFS/BFS, Floyd-Warshall
Courses
There some courses that use the book(Data Structures and Algorithms in Python) as textbook.(Tell me please, if you know other courses use it:-)
- 数据结构与算法-Python (2019秋季),武汉大学
Great lecture notes.
References:
- Jenny's lectures CS/IT NET&JRF
Jenny makes everything clear!
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.