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

4 votes58 views3 answers
How to get a character from a string in python
Python
1 vote67 views1 answer
Django httpresponseredirect
Python
2 votes61 views1 answer
Make a script run itself again python
Python
1 vote57 views1 answer
Python - count values that contain special characters
Python
25 votes69 views2 answers
Python if null
Python
0 vote65 views1 answer
Filter dict by list of keys python
Python
2 votes76 views1 answer
Partially initialized module 'tkinter' has no attribute 'Tk
Python
2 votes63 views1 answer
Python argparse ignore unrecognized arguments
Python
67 votes55 views6 answers
Deleting duplicates in list python
Python
0 vote60 views1 answer
Sorting-a-python-list-by-two-fields
Python