AVL 1 Introduction

Показать описание

Dr. Rob Edwards from San Diego State University introduces AVL trees and discusses how to balance them

Рекомендации по теме

Комментарии

As someone mentioned below, the last example is incorrect. But when we think about why, or how it should be done, we shouldn't start at the top and go down. We should think recursively, based on how node insertion works. Node insertion starts at the top of the tree and recursively descends until it finds the place to add the new node. Then, after adding the node, we unwind the recursion, returning back up the tree, updating the height as we go, checking each time whether the tree is unbalanced. In the example the tree is not unbalanced until we get back up to the root node, 4. That's why the (double) rotation should be centered on 4 (right on 10 and then left on 4, as mentioned below).

fredonianewmancenter

I wish I had Teatchers like him in my university.

BloodHaZaRd

5:36 - What he means is he has a height of 3 children on the right of the four. This is why AVL trees call them 'heights' and not 'children', because it can be very confusing otherwise. Here, the four seems to have 4 children, but what the teacher means is that the height of its children is 3.

jakethewoz

This is the best explaination of avl trees, I have ever heard. Thank you for being so clear and concise.

oliverdo

Best explanation i've come across so far. Brilliant and simple. Wonderful vid! Thank you so much for this!

fredericoamigo

@RobEdwardsSDSU
, there are several mistakes
1. Minor, there are number 8 written as 6.
2. Major - you are rotating wrong numbers near 6:00. You should rotate right and get 8 parent of 10 and 10 parent of 9 and 12 ( 9/10\12 ) and then rotate left and make 8 root.

slitynskyy

this guy is insane the way it was explained it made so much sense

glowstonedust

how come first time 9 is considered to be the violating node and not 8.
And later after left right, 10 is considered the violating node and not 12.
How do we select the violating node ?

jalajkhanna

This was exactly the instruction that I needed to understand height better, and to understand rotations. Thank you.

TheElof

Breaks down the problem properly. Love it

sikhokhelekhohliso

Thanks a bunch. The best explanation ever.

freshbreeze

Thanks very much Dr. Rob, extremely well articulated information! Love the analogies. Home-wrecking single parents lol

returnMarcco

Are you writing in mirror image? If so, that is impressive.

iamhaileyrene

awesome explaination. ..but how is he writing those letters on glass.

sujaysshenoy

at 5:53 ... why isn't the root the violation? can't you just do one rotation of the root to its left child from the start to fix it?

EricSmith-tspj

You are doing awesome lectures! Thanks so much!

KansasFashion

Excellent video, helped me so much. Thanks!

惜小夜

who cares about the trees
that dude is writing like backwards, teach me that instead

georgevasiliadis

Thank you so much! Your videos on avl trees are great!

heikeneubau

Great videos. Balancing makes a lot more sense, now.

mezzamate

AVL 1 Introduction

AVL 1 Introduction

AVL trees in 5 minutes — Intro & Search

10.1 AVL Tree - Insertion and Rotations

Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL

AVL Trees Simply Explained

Data Structure - AVL Tree - Introduction - Part 1

AVL Tree 1: BST Balance & AVL Tree Intro

COMP2321 AVL 1 Introduction Dr Radi Jarrar

DSA30a - Introduction to AVL Tree | Rotations

1. AVL Tree - Introduction

AVL Trees - Introduction

AVL Tree | Introduction | Part 1 | Data Structures

AVL tree Data Structure (Introduction, Rotations)

tree/avl(1)/introduction

AVL Tutorial (1) - Basics, Program Structure

1. Data Structure & Algorithm: AVL Trees - Introduction

5.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials

The 3 Levels of Binary Trees | Standard, Binary Search Trees (BST) and Self-Balancing (AVL)

AVL Data Management | Overview

But violence likesss me...😱😁😂 | #shorts #youtubepartner #jennyslectures

Avl tree | Introduction | DS | Data Structures | Lec-40 | Bhanu Priya

AVL TREE ( Introduction) ||part-1

Don’t learn Data Structure before knowing this ❌❌

5 Most Common Job Interview Questions that you must prepare for any Job Interview