Data Structure & Algorithms PART I

Kursinnhold

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.

Alt var klart?

Takk for tilbakemeldingene dine!

Seksjon 3. Kapittel 7

Spør AI

Spør om hva du vil, eller prøv ett av de foreslåtte spørsmålene for å starte chatten vår

Kursinnhold

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.

Alt var klart?

Takk for tilbakemeldingene dine!

Seksjon 3. Kapittel 7

some-alt