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

77 votes99 views6 answers
Random from list python
Python
2 votes127 views4 answers
Python repr()
Python
0 vote54 views0 answer
Python
5 votes98 views2 answers
Who created python
Python
0 vote100 views1 answer
Find python background process id
Python
10 votes109 views5 answers
Ordered dictionary python
Python
0 vote100 views1 answer
Python write subprocess stdout stderr to file
Python
0 vote133 views2 answers
How to avoid inserting duplicate records in orm django
Python Django
15 votes212 views6 answers
Flask setup
Python Flask
0 vote112 views1 answer
How to unpivot dataframe pandas
Python