original_docstring: 
              DEPTH FIRST SEARCH. Given a starting node (root) traverse the tree!
              Input lists, xs and ys, will contains the names and data respectively 
              of each leaf
          
docstring: DEPTH FIRST SEARCH. Given a starting node (root) traverse the tree.
  Input lists, xs and ys, will contains the names and data respectively
  of each leaf
docstring_tokens: DEPTH FIRST SEARCH . Given a starting node ( root ) traverse the tree . Input lists xs and ys will contains the names and data respectively of each leaf
code: def DFS(root,xs,ys):
          """
              DEPTH FIRST SEARCH. Given a starting node (root) traverse the tree!
              Input lists, xs and ys, will contains the names and data respectively 
              of each leaf
          """
  
          if root is not None:
  
              if root.left:
                  hierarchical.DFS(hierarchical.nodes[root.left],xs,ys)
              if root.right:
                  hierarchical.DFS(hierarchical.nodes[root.right],xs,ys)
  
              if root.name.startswith("V"):
  
                  xs.append(root.name)
                  ys.append(root.data)
              else:
                  pass
code_tokens: def DFS ( root , xs , ys ) : if root is not None : if root . left : hierarchical . DFS ( hierarchical . nodes [ root . left ] , xs , ys ) if root . right : hierarchical . DFS ( hierarchical . nodes [ root . right ] , xs , ys ) if root . name . startswith ( "V" ) : xs . append ( root . name ) ys . append ( root . data ) else : pass
short_docstring: DEPTH FIRST SEARCH.
short_docstring_tokens: DEPTH FIRST SEARCH .
comment: """
              DEPTH FIRST SEARCH. Given a starting node (root) traverse the tree!
              Input lists, xs and ys, will contains the names and data respectively 
              of each leaf
          """