public void bfs(Node rt)
	  {
		  Queue<Node> q = new ArrayDeque<Node>();
		  
		  if(rt != null) q.add(rt);
		  
		  while(!q.isEmpty())
		  {
			  Node tNode = q.remove();
			  
			  System.out.print(tNode.value+" ");
			  
			  if(tNode.left!=null)
				  q.add(tNode.left);
			  
			  if(tNode.right!=null)
				  q.add(tNode.right);
		  }
		  
	  }