Binary Search Tree - Search Pseudo Code

Video 65 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the pseudo code for searching in a binary search tree.

This video is meant for educational purposes only.

[christo]

One of the best video on BST searching.. thanks a lott....

[badloo]

brief, simple, obvious and outstanding explanation keep up

[riteshbadhani]

please arrange your videos so that we can auto play one after another.

[vcconxept_gh]

simple and your handwriting is amazing

[aadiltai]

ma'am this is the best example ever i have seen

[igordc]

One of the few videos about bst search that I found useful. In 8 minutes of video she explained what many in 40 minutes or 1 hour of video cannot explain. I loved, now I do understand how this algorithm works.

[mmredditreview]

Thank you sis adha ghanta baad mila re, , tune bohot time bachaya hai behen

[krishnendu-jana]

Supperb videos to coverup DSA, very much appriciate your work :)

[maazsiddiqui]

why we are returning root? instead of value

[chinthakayalasrinivasgoud]

Plz can u keep ur answers in one book serially

[kishan]

Where is the pseudocode? The title is misleading

[JiggyJiggy]

I've been watching a few of her videos. Straight forward to the point. She made data structure so easy. I wish my professors would teach like this.

[TheMhiayon]

Jesus Christ, how can videos so magnificent be so free.

[saisivaganeshjanga]

Just loved your explanation madam....thanks a lot...

[shamasurrehmanshamasurrehm]

what happen if the right side of node have both small and high value
and what happen if the left side of node have small and hight value
tell me