TatevKaren / DataStructuresAlgorithmsCourse

DataStructuresAlgorithmsCourse

1: Binary Search Trees

Binary Search Tree Introduction

• Insert
• Find
• Update
• List All

Python Code here ->

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))

Python Code here ->

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 ->