CS 61B Lecture 25: Binary Search Trees

[eventviewer26]

Thanks for the video sir.. But I have a question.. why do we allow duplicate keys in this kind of structure? I just want to clarify it thanks.

[MoonLightFacade]

They use Java as an example. Pffft.

[LilKilla15]

The invariant is wrong: Left sub tree is less than root. Right subtree is GREATER THAN OR EQUAL TOO.

[ShokoDemon]

@LilKilla15 no it isn't, @ 10:12

[rpowell1986]

Great video many thanks. However I don't agree with binary search trees allowing multiple keys of the same value. As it will result in retrieving the same key each you search for it & not the other key

[pogota1]

greatttttttttttttttttttttttttt­ttttttttttttt! i love you i mustt say :)

[smayengbam]

thank you for the excellent presentation.

[RohitDumbre86]

This proff is really passionate into teaching .. other proffs usually don't like their stuff to go online

[thebuzz2010]

This is very good!

[dineshthedemonised]

hes cool



[brianjv99]

Malkovich?

Malcovich malkovich.

Malkovich malkovich, malkovich!

[shafayetbu]

Brilliant ppl don't deserve to be that coool!!! he's perfect...

[slapcompany]

There is no safe container to store your values while you’re at work; not living your deepest values will leak on you

No sudden moves: You’re looking emotional commitment right in the eye. slapCompany Question to you: Where do you stand?

[dying2l]

This is a very good explanation. Thank you.

[eatmyshorts2007]

mand these ph.d have some crappy hand writings haha

[ssjg0ten]

he reminds me of Dr Reid from Criminal Minds lol

[chinnywurl]

@ssjg0ten I was just about to make that same comment lol ..

[stb6688]

For the removal operation, if when you search the right subtree for the last left leaf: what if the sub tree right subtree has no left leaf?

[undergroundo]

YES! He sound like John Malkovich! LOL

[iambmelt]

He answers the question @ 23:00 wrong - that left/right (min/max) rule neither exists nor makes sense. Imagine a value smaller than anything in the BST, there wont be any right (towards greater values) walks, thus the rule cannot apply.

[johnbeatle]

also Freakfest looks like fun

[johnbeatle]

can i get his writing font in ms word? lol

[lycheewater]

Is it just me or does he look/sound like John Malkovich?

[kostantinos74757]

@lycheewater I was thinking of the same think a lot of videos ago.

[brijix1111]

Isn't allowing duplicates in only one side, much easier to search/manage? If both sides are allowed the duplicates, we will have to search for left, right node recursively till we don't find new nodes. If duplicates are allowed only on one side, we have to search less, only for say right nodes...

[RichTCovers]

it hurts to watch him write, hahaha, it's so ugly! but he did well teaching, thanks! =]

[Time4TruthDOTorg]

This is why there is no point going to my university for lectures... Not only do the lecturers just read from their slides, but they do a crap job at explaining.

With lectures like this, I can stay home where it's nice and warm, not waste 1hour on travel there and 1hour travel back, and I learn something!

Thanks!!

[MrUsman4040]

Very Good Lecturer Of Data Structure.

[oscar341]

lol java

[yapabh]

Nicely elaborated......awesome lecture.....thank you for the video

[biiiik]

in java

[biiiik]

can somebody give me a

sample program for binary search tree??

[Time4TruthDOTorg]

@biiiik I have 1, if you are still interested. Let me know.

[rockvista]

Loves these videos :) he is awsome teacher. One problem is while explaining one operation sometime Prof performs another associative operation w/out explaining that one clearly which might be issue with first timers. like while drawing new tree @ 39 min he replace 12 with 13 but how 14 takes the place of 13 is abstract.

[jimgeroul]

@rockvista 14 takes place of 13 because it is suposed to.. it is just like we want to delete 13 from the tree.. you remove it and then you replace it with its only child. so 14 takes place of 13. i dont know if i am clear on my explanation..

[tantrikwizard]

what a fag. Keep that dork professor on the teaching staff, he wouldn't last 2 seconds on a team project.

[hexam1ner]

@tantrikwizard sure u can do a better job!! if u r so good, come up with ur own video as**ole.

learn to be grateful for what u r getting for free.

[bazucccada]

hey, can you tell me wich one of this combinations generates a self-balanced BST?

18,21,23,25,15,19,16,12 or 18,23,16,21,15,19,12,25 ?? i can't understand the concept behind "self balanced" is it the number of nodes, or the height? help me please i have a test tomorrow!

[AnepuSchwarzwolf]

Nevermind my other comment.

I've just thoght it all over and came to the conclusion that it's just a matter of designing the tree ^^

[Dagguh]

@AnepuSchwarzwolf yeah, the thing is node 29 could NOT have node 31

[Jaggling]

@AnepuSchwarzwolf Oops, already answered, that will teach me to respond before I read all the comments, instead of bouncing around the comments. *self depreciating chuckle*

[AnepuSchwarzwolf]

First to say: I really enjoy this lessons :)

But there are two or rather one thing that i don't really get.

He says the very last node on the left side IS the minimum key and the very last node on the right IS the maximum key.

If i'm looking at the graph he drew at 22:27 that doesn't quite work for me.

Key '29' could have a right node with key value '31' if i'm not completly wrong.

Method last() would return key '30' even though key '31' is the maximum key.

Please correct me if im wrong :)

[Jaggling]

@AnepuSchwarzwolf Except that to reach 29 you had to take a left branch (taking you through 28), the maximum value is the farthest to the right of the tree, not the farthest right deepest in the tree. Its one of the easiest things to mix up when trying visualize with tree structures.

[LieutenantFakenham]

John Malkovich is eerily convincing as a CS instructor.

[patilsw]

I would however prefer recursive code.

[hovrashko]

very helpful and informative, thank you =)

[ghodkiller000]

thx, very helpful for stupid exam

[gurth4ng]

Really thanks a lot for this video, it has been very helpful.

[MrRavisankar]

thanks a lot for this lecture..

[Scarabus82]

He totally sounds just like John Malkovich.

[mnightt]

thanks a lot, even in english its more understandable for me than at lessons in institue =)

[Crawletas]

agreed

[Johannady]

ahh! i was worried maybe there isn't any tutorials on this :p

[NajanJan]

hi, thanks for this lecture.

I just don't understand that when we insert a key, what is the second Object (associated value)? so let's say we're inserting a 7 to a tree then what is its associated value?

[hetler25]

wow .

i like BST's but i wish i could implement at least the Node itself :P loooool

nice video , this is serious coding !

[vkgoku2012]

You look like that guy and sound like that guy of criminal minds it so cool.