Tree Sort
An interactive, step-by-step visualisation of Tree Sort.
- Category
- Sorting
- Time complexity
- O(n log n) avg
- Space complexity
- O(n)
Pseudocode
for v in a: insert v into BST inorder traversal of the BST yields sorted output
Reference implementation
root = None
for v in a:
root = bst_insert(root, v)
return inorder(root)