MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / inorder

Function inorder

sorts/tree_sort.py:26–31  ·  view source on GitHub ↗
(root, res)

Source from the content-addressed store, hash-verified

24 self.val = val
25
26def inorder(root, res):
27 # Recursive travesal
28 if root:
29 inorder(root.left,res)
30 res.append(root.val)
31 inorder(root.right,res)
32
33def treesort(arr):
34 # Build BST

Callers 1

treesortFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected