title: implement a Queue using a BST
body: <p>How do i implement a Queue using a BST.</p>
  
  <p>Is this the way to do it, keep on inserting the nodes in the tree while maintaining a count value associated with each and every node,but while deletion BST should work like queue(FIFO) so start deleting from BST with the node having lowest count value in the tree.</p>
  
  <p>Did i get the question and solution right? If not,then please explain me the question.</p>