GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes
worst-case complexities of insertion and deletion of a key in a binary search tree

The time taken by search, insert and delete on a BST is always proportional to height of BST. Height may become O(n) in worst case.
asked in trees, binary search trees, binary heaps by gate

Related questions

The best answer to any question