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
              # visit, runs lambda and prints the node
              callable(node)
  
              # go left
              if node.left is not None:
                  _walk(node.left)
  
              # go right
              if node.right is not None:
                  _walk(node.right)
code_tokens: def _walk ( node = None ) : if node is None : return callable ( node ) if node . left is not None : _walk ( node . left ) if node . right is not None : _walk ( node . right )
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$# visit, runs lambda and prints the node$SEP$# go left$SEP$# go right