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 vote183 views1 answer
Drop duplicates pandas considering lowercase
Python
0 vote187 views1 answer
Python int in list
Python
6 votes186 views2 answers
Scatter plot plotly
Python
0 vote189 views1 answer
Sns prevent legend
Python
0 vote183 views1 answer
Render django views
Python
2 votes196 views1 answer
Django static media
Python
0 vote189 views1 answer
Python random real
Python
0 vote188 views1 answer
Pthon return value with highest occurences
Python
2 votes177 views1 answer
Python initialise dataframe
Python
0 vote179 views2 answers
Insert character into string at position x python
Python