https://github.com/tatevkaren/datastructuresalgorithmscourse
https://github.com/tatevkaren/datastructuresalgorithmscourse
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/tatevkaren/datastructuresalgorithmscourse
- Owner: TatevKaren
- Created: 2022-09-30T11:57:25.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2022-10-09T09:48:54.000Z (about 3 years ago)
- Last Synced: 2025-04-09T18:12:08.819Z (6 months ago)
- Language: Python
- Size: 182 KB
- Stars: 4
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DataStructuresAlgorithmsCourse
## 1: Binary Search Trees
### Binary Search Tree Introduction
- Insert
- Find
- Update
- List All
### Binary Search Tree Function
- height of the tree
- size of the tree
- inorder traversal
- preorder traversal
- postorder traversal
- converting tree to tuple
- parsing tuple to tree
Python Code here ->
## 2: Sorting
- Bubble Sort (Time Complexity: O(n^2), Space Complexity: O(n))
- Insertion Sort (Time Complexity: O(n^2))
- Divide & Conquer Merge Sort (Time Complexity: O(nlogn))
- Quick Sort (Time Complexity: O(nlogn))
## 3: Recursion and Dynamic Programming WIP
### Questions for Interview
- Question 1: Getting The Right Card ->
- Question 2: Start and End Positions of Given Number ->
- Question 3: Minimum Number of Rotations to get ordered list ->
- Question 4: Traversing Binary Tree ->
- Question 5: Minimum Depth of Binary Tree ->
- Question 6: Maximum Depth of Binary Tree->
- Question 7: Height and Size of Binary Tree ->
- Question 8: Checking whether Binary Tree is Balanced and Making it Balanced ->
- Question 9: Diameter of Tree ->
- Question 10: Current Level Order Traversal ->
- Question 11: Checking Whether Binary Tree is Complete ->
- Question 12: Notebook Recommender ->