|**Operation**|**Best Time Complexity**|**Average Time Complexity**|**Worst Time Complexity**|**Memory Complexity**|
|---|---|---|---|---|
| `Search` | `O(log n)` | `O(log n)` | `O(log n)` | `O(n)` |
| `Insertion` | `O(log n)` | `O(log n)` | `O(log n)`| `O(n)` | 
| `Deletion` | `O(log n)` | `O(log n)` | `O(log n)` | `O(n)` |

Click [here](https://drive.google.com/uc?export=download&id=1qFylE2jPbf_As0FrE8xdWU-z8AyNGq-5) to download video subtitles.

Choose what type of rotation is needed to complete the AVl-tree

Algorithms and Data structures are the basements of computer programming. Moreover, you will learn this topic with easy examples. After the course, you will be filled with ADS knowledge, analytical thinging and a perfect mood!

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

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

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

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

Operation	Best Time Complexity	Average Time Complexity	Worst Time Complexity	Memory Complexity
`Search`	`O(log n)`	`O(log n)`	`O(log n)`	`O(n)`
`Insertion`	`O(log n)`	`O(log n)`	`O(log n)`	`O(n)`
`Deletion`	`O(log n)`	`O(log n)`	`O(log n)`	`O(n)`

AVL TREE