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 vote143 views1 answer
Sound in python
Python
14 votes233 views1 answer
2 list difference python
Python
0 vote205 views1 answer
Dictionary with list as value py
Python
1 vote144 views1 answer
Flask console log
Python
0 vote201 views1 answer
Initiate dask
Python
2 votes188 views1 answer
Python pandas apply to one column
Python
0 vote161 views1 answer
Replace all string in list python
Python
1 vote181 views1 answer
Error: can't copy 'brz.1': doesn't exist or not a regular file
Python
1 vote199 views1 answer
Pandas read_csv drop last column
Python
2 votes190 views1 answer
Private variables python
Python