DSA-Python
Data Structures and Algorithms created within Python as part of the Codecademy "Practice for the Technical Interview with Python" Course.
George-Madeley
main
public
George-Madeley
main
public
This Repo is following the codecademy "Interview Practice Python" Course.
In this repo, I will be creating amny linear and complex data structures along with different corting and searching algorithms that i can later apply to other python based projects.
Add() and RetrieveMin() methods based on the Codecademy design.insert() method based on the Codecademy design.AddChild() and RemoveChild() methods based on the Codecademy design.Retrieve() and Assign() methods based on the Codecademy design.Peek(), Pop(), and Push() methods based on the Codecademy design.__str__() method to Queue class.Peek(), Enqueue(), and Dequeue() methods based on the Codecademy design.FindIndexOfValue(). It is based off of the Codecademy design.FindIndexOfValue(), FindIndexesOfValue(), FindMaximum(), and FindMinimum(). These are based off of the Codecademy design but have been altered to suit a class based structure.__str__()Started the Linear Data Structures aspect.
Added a Node class as a foundation for the ohter data structures.
Data Structures and Algorithms created within Python as part of the Codecademy "Practice for the Technical Interview with Python" Course.
0
0
0
0