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

5 votes119 views2 answers
Skitlearn decision tree
Python
0 vote111 views1 answer
Create a date value array in python
Python
0 vote115 views1 answer
Music distorted on discord
Python
2 votes85 views3 answers
Set axis ticks matplotlib
Python
1 vote154 views1 answer
Could not locate a bind configured on mapper mapped class class->tablename, SQL expression or this Session.
Python
0 vote112 views1 answer
1 12 123 python
Python
6 votes79 views1 answer
Unicodeencodeerror: 'charmap' codec can't encode characters in position 0-3: character maps to <undefined>
Python
2 votes131 views1 answer
How to operate on all elements in a list python
Python
76 votes146 views6 answers
Python iterate through list
Python
19 votes108 views1 answer
Pygame scale image python
Python