original_docstring:  recursion! Function calls itself. The recursion needs to know
                  when to stop. The return here acts at the base case when the
                  node is None
                  
docstring: recursion. Function calls itself. The recursion needs to know
  when to stop. The return here acts at the base case when the
  node is None
docstring_tokens: recursion . Function calls itself . The recursion needs to know when to stop . The return here acts at the base case when the node is None
code: def _walk(node=None):
                  """ recursion! Function calls itself. The recursion needs to know
                  when to stop. The return here acts at the base case when the
                  node is None
                  """
                  if node is None:
                      return
                  # go left
                  if node.left is not None:
                      _walk(node.left)
  
                  # go right
                  if node.right is not None:
                      _walk(node.right)
                  # visit, runs lambda and prints the node
                  callable(node)
code_tokens: def _walk ( node = None ) : if node is None : return if node . left is not None : _walk ( node . left ) if node . right is not None : _walk ( node . right ) callable ( node )
short_docstring: recursion!
short_docstring_tokens: recursion!
comment: """ recursion! Function calls itself. The recursion needs to know
                  when to stop. The return here acts at the base case when the
                  node is None
                  """$SEP$# go left$SEP$# go right$SEP$# visit, runs lambda and prints the node