Advanced Data Structures: Binary Search Tree (BST) Time Complexity

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

Рекомендации по теме
Комментарии
Автор

Excellent explanation on Binary Search Trees. Thank you Niema!

stevepoper
Автор

Binary search Tree and Big O notation very nicely explained Niema, thank you.

markward
Автор

Great explanation. what tool do you use to draw and how do you send the output to main screen?

traindeluxe
Автор

At 18:24, isn't depth of the root node is 0?

Because, according to the definition: The depth of a node is the number of edges from the root to the node.

harikirankante