Discover data structures and algorithms using Python. Gain insights into solving real-world problems and typical interview questions with detailed reviews, explanations, and hands-on coding exercises.

Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

A **binary tree** is a tree data structure in which each node has at most two children, which are referred to as the *left child* and the *right child*. Have a look at an elementary example of a binary tree:

Here is another example of a binary tree that introduces us to other related terminologies:

# Depth of a Node
The length of the path from a node, *n*, to the root node. The depth of the root node is 0.

# Height of a Tree

The length of the path from *n* to its deepest descendant. The height of the tree itself is the height of the root node, and the height of leaf nodes is always 0.

In this lesson, you will be introduced to Binary Trees and their implementation in Python. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Introduction

Depth of a Node #