title: Running time complexity for binary search tree
body: <p>I already know if you try to find the item with particular key the running time of worst case
  is <code>O(n)</code> ,<code>n</code>is the number of node. If you try to print out all the data items in order of their keys then the running time of worst case is <code>O(n)</code>. If you try to search for a particular data item(you don't know the key) then the running time of worst case is O(n). However, what if the keys and data are both integers and, the input items were randomly scrambled before they were inserted. Will the worst cases of running time still the same?</p>