Binary Search Tree (BST) | Part-1/2 | Data Structures | Lec-33 | Bhanu Priya

preview_player
Показать описание
introduction to binary search tree (BST)& examples
Рекомендации по теме
Комментарии
Автор

10 should be left to 20, since it's smaller. it's wrong

roseannepark
Автор

But how 10 is greater than 20, 10 should on left side of 20, how to wrote on right side of 20 ?

niteshprajapat
Автор

7:21 pe jo 20-->10 pe ja raha hai wo condition satisfy nahi kar raha hai

VishalKr
Автор

What about breadth first traversal concept in binary tree.

chamuchamu
Автор

It's wrong, binary search tree must have at most 2 children only

Moneysiva
Автор

Can i know is searching and binary searching are same?

sathvikatirtullai
Автор

Need threaded binary trees in data structures mam

saibabaram
Автор

It's wrong.. Right node should always greater than root node irrespective of level of the BST..

satyaranjan
Автор

Mam very nice teaching
Please tell me about yourself

ANKITKUMAR-oxht