Data Structure & Algorithms PART I

Data Structure & Algorithms PART I

0%

1. Introduction to ADS

In this section, we will learn ADS basics and main terms.

What is an Algorithm?

Data Structure and Types

Asymptotic Notations 1/2

Asymptotic Notations 2/2

2. Data Structures Part I

Linear data structures are waiting for you! Stack, queue, linked list, and hash table in the end!

3. Trees Part I

In this section, we will learn the most famous trees and try to implement them with the help of Python.

Tree Data Structure

Binary Tree and Its Types

Heap Data Structure

BST Deletion

4. Trees Part II

Here we will learn not such famous trees but so interesting tree data structures!

More about Binary Trees

To be Continued

Course Content

Data Structure & Algorithms PART I

Data Structure & Algorithms PART I

1. Introduction to ADS

What is an Algorithm?Data Structure and Types Asymptotic Notations 1/2 Asymptotic Notations 2/2

2. Data Structures Part I

Stack Queue Types of Queue Linked List Hash Table Hash Collision

3. Trees Part I

Tree Data Structure Binary Tree Binary Tree and Its Types Heap Data Structure BST BST Insertion BST Deletion AVL TREE

4. Trees Part II

More about Binary Trees B Tree Prefix Tree Octree To be Continued

BST Deletion

There are also some cases while deleting nodes from the tree:

Deleting the leaf node;
Deleting the node with 1 child;
Deleting the node with 2 children.

Deleting the leaf node

We may simple remove the leaf node without any crucial changes in the tree.

Deleting the node with 1 child:

Replace that node with its child node;
Remove the child node from its original position.

Deleting the node with 2 children:

Get the inorder successor of that node;
Replace the node with the inorder successor;
Remove the inorder successor from its original position.

Everything was clear?

Thanks for your feedback!

Section 3. Chapter 7

some-alt