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 vote305 views1 answer
Numpy isinstance
Python
0 vote325 views1 answer
Use mark down with flask
Python
0 vote303 views1 answer
Python bufferedreader
Python
1 vote331 views1 answer
Np confidence interval
Python
0 vote299 views1 answer
Random string generate python of 2.7
Python
0 vote313 views1 answer
Group by to a collect datafame
Python
0 vote317 views1 answer
Yamaha palhetas
Python
7 votes319 views3 answers
Dictionary from two columns pandas
Python
0 vote345 views1 answer
Pandas difference between subsequent lines
Python
0 vote299 views1 answer
Install python package from git colab
Python