title: Big O Complexity in Binary Search Tree(BST)
body: <p>i've been reviewing all the stuff i've learned, and found out that this <a href="http://bigocheatsheet.com/" rel="nofollow">website</a>, and it is saying the worst case of searching in Binary Tree has O(n) complexity. So far i've known, in Binary search tree is a sorted tree that we can search with binary search which has O(log n)-log base 2 probably.</p>
  
  <p>Could anyone explain?</p>