title: how is there a one to one correspondence between quick sort partition and binary search tree?
body: <p>If we take some elements, partition them on the first element. Now taking the partition element as the root of a binary tree we insert these elements in the binary. Would there be a one to one correspondence?</p>
  <p>Could someone explain how is there a one to one correspondence between elements??</p>