15.10.1 Insertion and deletion in a BST

#1

[EPIJ v 1.6.1]
May I assume that this problem isn’t asking for a balanced tree implementation of insertion and deletion? In other words, is it ok for insertion and deletion to allow the height of the BST to exceed O(log n)?

0 Likes
#2

No, this problem does not ask for balanced tree after that.

0 Likes