BST incorrect time complexity

[Rohithyeravothula]

Insertion, deletion, access and search time complexities of BST are incorrect, they must be O(h) where h = height of the BST, and not O(log(n)). In cases, where BST is a balanced BST, h will be log(n) and the time complexities will be O(log(n)), else h can be n (no of nodes) in worst case so the time complexities will be O(n).

[bessex]

Your assumption is that the listed time complexities should be worst case though, right? Is this project intended to provide average or worst case time complexity?