Skip to content

Latest commit

 

History

History
29 lines (26 loc) · 1.94 KB

README.md

File metadata and controls

29 lines (26 loc) · 1.94 KB
Raw

Abstract Data Types

About the project

  Hello World!. Welcome to my Abstract Data Types GitHub Portfolio. This project it's just me reinventing the wheel. In others words, It's some Abstract Data Types implemented using Python from scratch.
  There are documentations, exemplos and the code. You can also download, use or even, improve them.
  That is it! :D

Projects

  • Queue - Abstract Data Type with First In First Out rule.
  • Circular Queue - A different Queue implementation which uses the modulo operator instead of Cell class.
  • Deque - An improvement of Queue Data Type which allows add to and remove from both sides.
  • Dequeued Queue - A Deque with new feature. It'll remove an element when if full, instead of raise an error.
  • Stack - Abstract Data Type with First In Last Out rule.
  • Linked List - A list abstract data type which each cell can only access the next cell.
  • Doubly Linked List - A list abstract data type which each cell can access the next and the preivious cell. Easy to search, insert and remove elements.
  • Binary Search Tree - Abstract data type based on Nodes which the left nodes have a lower key_id than the parent node and the right nodes have higher key_id.