Which is not true for B-Tree?
time complexity to search, insert and delete is O(Logn).
Please Register/Login to Download Question