Data Structure & Algorithms PART I

Contenuti del Corso

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

To be Continued

There are so many different tree types. It is too hard to learn all of them during one course.

During the course, we talked a lot mostly about data structures.

If you get to this chapter, you are a super student!

You probably noticed PART I in the title.

The PART II is needed for you to say 'I am good at ADS!'

We didn't talked much about algorithms in this course, but we will do that in the PART II course!

Take a rest and prepare for the second challenge!

Tutto è chiaro?

Grazie per i tuoi commenti!

Sezione 4. Capitolo 5

Chieda ad AI

Chieda pure quello che desidera o provi una delle domande suggerite per iniziare la nostra conversazione

Contenuti del Corso

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

To be Continued

There are so many different tree types. It is too hard to learn all of them during one course.

During the course, we talked a lot mostly about data structures.

If you get to this chapter, you are a super student!

You probably noticed PART I in the title.

The PART II is needed for you to say 'I am good at ADS!'

We didn't talked much about algorithms in this course, but we will do that in the PART II course!

Take a rest and prepare for the second challenge!

Tutto è chiaro?

Grazie per i tuoi commenti!

Sezione 4. Capitolo 5

some-alt