mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 06:09:28 +00:00
02c0daf9e5
* Adding variable to fade out ambiguity * More readability on merge sorting algorithm * Updating merge_sort_fastest description and explaining why * Adding tests file with imports * Standardazing filenames and function names * Adding test cases and test functions * Adding test loop * Putting 'user oriented code' inside main condition for having valid imports * Fixing condition * Updating tests: adding cases and todo list * Refactoring first euler problem's first solution
47 lines
1.1 KiB
Python
47 lines
1.1 KiB
Python
# Tree_sort algorithm
|
|
# Build a BST and in order traverse.
|
|
|
|
class node():
|
|
# BST data structure
|
|
def __init__(self, val):
|
|
self.val = val
|
|
self.left = None
|
|
self.right = None
|
|
|
|
def insert(self,val):
|
|
if self.val:
|
|
if val < self.val:
|
|
if self.left is None:
|
|
self.left = node(val)
|
|
else:
|
|
self.left.insert(val)
|
|
elif val > self.val:
|
|
if self.right is None:
|
|
self.right = node(val)
|
|
else:
|
|
self.right.insert(val)
|
|
else:
|
|
self.val = val
|
|
|
|
def inorder(root, res):
|
|
# Recursive travesal
|
|
if root:
|
|
inorder(root.left,res)
|
|
res.append(root.val)
|
|
inorder(root.right,res)
|
|
|
|
def tree_sort(arr):
|
|
# Build BST
|
|
if len(arr) == 0:
|
|
return arr
|
|
root = node(arr[0])
|
|
for i in range(1,len(arr)):
|
|
root.insert(arr[i])
|
|
# Traverse BST in order.
|
|
res = []
|
|
inorder(root,res)
|
|
return res
|
|
|
|
if __name__ == '__main__':
|
|
print(tree_sort([10,1,3,2,9,14,13]))
|