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

1 vote152 views1 answer
Np deep copy matrix
Python
0 vote158 views1 answer
Match statement
Python
13 votes147 views3 answers
Pandas sample
Python
1 vote186 views1 answer
How to check the django version on a mac
Python Django
0 vote152 views1 answer
How to sort a list in python with if
Python
1 vote156 views1 answer
How to search where a character is in an array in python
Python
0 vote193 views1 answer
Django customize the user model
Python Django
-3 votes156 views1 answer
Get path of open file python
Python
8 votes272 views5 answers
Django message framework
Python Django
3 votes145 views4 answers
Seaborn pairplot
Python