Binary Search Tree - Search Complexity

preview_player
Показать описание
Video 69 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the time complexity for searching in a binary search tree.

This video is meant for educational purposes only.
Рекомендации по теме
Комментарии
Автор

Level ND height of a tree is same or diff. I think level of root node is 0 ND height is 1
Means without adding a dummy node height is 3

siddiquiadnan
Автор

Thanks for your wonderful video of BST.

kannanv