Lesson 2 - Binary Search Trees, Traversals and Recursion

Data Structures and Algorithms in Python

Lesson 1 - Binary Search, Linked Lists and Complexity Assignment 1 - Binary Search Practice

Assignment 2 - Hash Tables and Python Dictionaries Lesson 3 - Sorting Algorithms and Divide & Conquer Assignment 3 - Divide and Conquer Practice Lesson 4 - Recursion and Dynamic Programming Lesson 5 - Graph Algorithms (BFS, DFS & Shortest Paths)Project - Step-by-Step Solution to a Programming Problem Lesson 6 - Python Interview Questions, Tips & Advice

Hindi Version: https://youtu.be/9Dpk_mYsqJc

In this lesson, we explore the use-cases of binary search trees, and develop a step-by-step implementation from scratch, solving many common interview questions along the way. Notebooks used in this lesson:

Binary Search Trees in Python: https://jovian.ai/aakashns/python-binary-search-trees
Problem Solving Template: https://jovian.ai/aakashns/python-problem-solving-template
Linked Lists in Python: https://jovian.ai/aakashns/python-classes-and-linked-lists

Ask questions and get help on the course community forum.

Notebooks

Your Notebooks

aakashns/python-binary-search-trees

Code it Yourself

aakashns/python-problem-solving-template

Code it Yourself

aakashns/python-classes-and-linked-lists

Code it Yourself