A--B--C
      |
      |
      D-F-G  
   

   
   DFS: A->B->C->D->F->G or 
        A->B->D->F->G->C


   BFS: G->F->D->B->A->C or
        G->F->D->B->C->A


Different traversals are possible since nehgbours are added to the stack/queue in arbitrary order.