filmov
tv
31251 Lecture 8.4: Height of a Binary Search Tree

Показать описание
The height of a BST is a critical factor in its performance. In this segment we talk about the worst-case and best case heights of the tree. We also briefly discuss the expected height of the tree when keys are inserted in random order.