how many of the following statements is incorrect regarding the time complexity of binary search tree,AVL Tree, min heap, binary tree?
i assumed non existent elements are those which do not exists in a tree,
acc to me only (a) is incorrect!
because to find any element in BST, It takes O(n) time