mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-05 21:29:29 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
73 lines
1.6 KiB
Python
73 lines
1.6 KiB
Python
"""
|
|
Tree_sort algorithm.
|
|
|
|
Build a Binary Search Tree and then iterate thru it to get a sorted list.
|
|
"""
|
|
|
|
from __future__ import annotations
|
|
|
|
from collections.abc import Iterator
|
|
from dataclasses import dataclass
|
|
|
|
|
|
@dataclass
|
|
class Node:
|
|
val: int
|
|
left: Node | None = None
|
|
right: Node | None = None
|
|
|
|
def __iter__(self) -> Iterator[int]:
|
|
if self.left:
|
|
yield from self.left
|
|
yield self.val
|
|
if self.right:
|
|
yield from self.right
|
|
|
|
def __len__(self) -> int:
|
|
return sum(1 for _ in self)
|
|
|
|
def insert(self, val: int) -> None:
|
|
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)
|
|
|
|
|
|
def tree_sort(arr: list[int]) -> tuple[int, ...]:
|
|
"""
|
|
>>> tree_sort([])
|
|
()
|
|
>>> tree_sort((1,))
|
|
(1,)
|
|
>>> tree_sort((1, 2))
|
|
(1, 2)
|
|
>>> tree_sort([5, 2, 7])
|
|
(2, 5, 7)
|
|
>>> tree_sort((5, -4, 9, 2, 7))
|
|
(-4, 2, 5, 7, 9)
|
|
>>> tree_sort([5, 6, 1, -1, 4, 37, 2, 7])
|
|
(-1, 1, 2, 4, 5, 6, 7, 37)
|
|
|
|
# >>> tree_sort(range(10, -10, -1)) == tuple(sorted(range(10, -10, -1)))
|
|
# True
|
|
"""
|
|
if len(arr) == 0:
|
|
return tuple(arr)
|
|
root = Node(arr[0])
|
|
for item in arr[1:]:
|
|
root.insert(item)
|
|
return tuple(root)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
print(f"{tree_sort([5, 6, 1, -1, 4, 37, -3, 7]) = }")
|