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

0 vote192 views1 answer
Trim strings python
Python
4 votes173 views1 answer
Python -c import pty;
Python
0 vote194 views1 answer
MEMORY MANAGEMENT SYSTEM IN PYTHON
Python
0 vote235 views1 answer
Styling filter form django
Python
1 vote216 views1 answer
Lecture de fichier python
Python
2 votes193 views1 answer
Expected ")" python
Python
1 vote185 views1 answer
Two elements at a time in list comprehension
Python
0 vote192 views1 answer
Get node name dynamo revit
Python
2 votes188 views1 answer
How to return PIL image from opencv
Python
42 votes215 views3 answers
Python get command line arguments
Python