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 vote290 views1 answer
Django graphene without model
Python Django
0 vote271 views1 answer
Outlier removal
Python
34 votes282 views5 answers
Remove substring python
Python
13 votes292 views4 answers
How to count number of unique values in a column python
Python
2 votes270 views1 answer
How to install from url in python
Python
7 votes282 views4 answers
Force utf-8 encoding python
Python
4 votes275 views1 answer
Video streaming flask
Python
0 vote293 views1 answer
Convert a pdf folder to excell pandas
Python
0 vote278 views1 answer
How to navigate to a sub html script selenium python
Python
0 vote273 views1 answer
Dictionary multiple values per key
Python