Tree searches - BST and DFS

TreeTraversal.java

void dfs(Node r) {
  if(r == null) 
    return; 
  visit(r); 
  r.visited = true; // avoid cycles 
  for(Node n : r.adjacent) {
    if(!n.visited)
      dfs(n); 
  }
}

void bfs(Node r) {
  Queue<Node> q = new Queue<Node>(); 
  q.enqueue(r); 
  while(!q.isEmpty()) {
    Node n = q.dequeue(); 
    if(!n.visited) {
      visit(n); 
      for(Node i : n.adjacent) {
        q.enqueue(i); 
      }
    }
  }
}