Binary Search Trees

To access the translated content:
1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/tr...
The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZh...
2. Regional language subtitles available for this course
To watch the subtitles in regional languages:
1. Click on the lecture under Course Details.
2. Play the video.
3. Now click on the Settings icon and a list of features will display
4. From that select the option Subtitles/CC.
5. Now select the Language from the available languages to read the subtitle in the regional language.

[@taruchitgoyal3735]

In the beginning of the session, example of air traffic controller was stated and the issues with respect to heap were observed when checking the predecessor and successor. Thus, can we say Binary Search Tree overcomes disadvantage of Heaps for finding successor and predecessor?

[@kirtanshah477]

good explanation

[@SHASHANKRUSTAGII]

love you sir

[@sudheerays9559]

thank you, love you too

[@SURENDRAKUMAR-um7tp]

can left child or right child equal to parent in case of BST?

[@ankithd7060]

yes

[@dushyantshukla8754]

One can hear DHOL in background at 20:00

[@sudheerays9559]

how many times will you say ??

[@dushyantshukla8754]

One can hear DHOL in background at 20:00

[@sudheerays9559]

oh