title: Dealing with "Keys" in Binary Search Trees
body: <p>Should I always, use some data as a key value while dealing with the Binary Search trees? I'm asking this becasue I would need key at some point of time
  if I want to search an element in the tree. Is thre any other alternative?</p>
  
  <p>For example, please consider the following code:</p>
  
  <pre><code>class Node {
  
  int iData;   // data used as key value
  double fData; // other data
  
  Node leftChild; // this node's left child
  
  Node rightChild; // this node's right child
  
  }
  </code></pre>
  
  <p>My Second Question: </p>
  
  <p>Is there any way I can find elements in a Binary Tree as Binary Tree doesn't have any property just like Binary Search Tree where left node of parent must be less than the parent and right node must be greater.</p>