Traversing a tree in python

"""Inorder Traversing"""
def inorder_traversing(self, root):
  res = []
  if root:
    res = self.inorder_traversing(root.left)
    res.append(root.data)
    res = res + inorder_traversing(root.right)
   return res

Source: tutorialspoint.com

Traversing a tree in python

"""Post-order"""
    def postorder_traversal(self, root):
        res = []

        if root:
            res = self.predorder_traversal(root.left)
            res = res + self.predorder_traversal(root.right)
            res.append(root.data)
        return res

Similar codes

6 votes223 views1 answer
Pip freeze requirements.txt no weird path
Python
-1 vote233 views1 answer
Django email verification
Python
0 vote245 views1 answer
"detail": "Method \"POST\" not allowed." django
Python Django
1 vote226 views1 answer
Know menu's height tkinter
Python
0 vote226 views1 answer
Python press key to break
Python
0 vote226 views1 answer
List of imported modules in python
Python
1 vote242 views1 answer
ValueError: Failed to convert a NumPy array to a Tensor (Unsupported object type float).
Python
0 vote216 views1 answer
Limpar idle python
Python
0 vote274 views1 answer
Seaborn create a correlation matrix
Python
0 vote217 views1 answer
Numpy get index of nan
Python