How is that possible that the worst case of the search is O(logn) for Binary Tree and is O(n) for Binary Search Tree?
Not possible. The cheat sheet is buggy
Hi @Pavlo_Koshla and @Mohit_Kumar,
This is Fatimah from Educative.
We recently updated the cheat sheet with an additional section focusing on the complexities of the Graph data structure. Please do check them out. Previously some of the mentioned complexities were average case instead of worst case which caused confusion. We apologize for that.
We hope Educative has inspired to further your learning.
Best Regards,
Fatimah Abdullah | Developer Advocate
Educative