mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
c15dda405a
* Update basic_binary_tree.py * Update basic_binary_tree.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
111 lines
2.6 KiB
Python
111 lines
2.6 KiB
Python
from __future__ import annotations
|
|
|
|
from collections.abc import Iterator
|
|
from dataclasses import dataclass
|
|
|
|
|
|
@dataclass
|
|
class Node:
|
|
data: int
|
|
left: Node | None = None
|
|
right: Node | None = None
|
|
|
|
def __iter__(self) -> Iterator[int]:
|
|
if self.left:
|
|
yield from self.left
|
|
yield self.data
|
|
if self.right:
|
|
yield from self.right
|
|
|
|
def __len__(self) -> int:
|
|
return sum(1 for _ in self)
|
|
|
|
def is_full(self) -> bool:
|
|
if not self or (not self.left and not self.right):
|
|
return True
|
|
if self.left and self.right:
|
|
return self.left.is_full() and self.right.is_full()
|
|
return False
|
|
|
|
|
|
@dataclass
|
|
class BinaryTree:
|
|
root: Node
|
|
|
|
def __iter__(self) -> Iterator[int]:
|
|
return iter(self.root)
|
|
|
|
def __len__(self) -> int:
|
|
return len(self.root)
|
|
|
|
@classmethod
|
|
def small_tree(cls) -> BinaryTree:
|
|
"""
|
|
Return a small binary tree with 3 nodes.
|
|
>>> binary_tree = BinaryTree.small_tree()
|
|
>>> len(binary_tree)
|
|
3
|
|
>>> list(binary_tree)
|
|
[1, 2, 3]
|
|
"""
|
|
binary_tree = BinaryTree(Node(2))
|
|
binary_tree.root.left = Node(1)
|
|
binary_tree.root.right = Node(3)
|
|
return binary_tree
|
|
|
|
@classmethod
|
|
def medium_tree(cls) -> BinaryTree:
|
|
"""
|
|
Return a medium binary tree with 3 nodes.
|
|
>>> binary_tree = BinaryTree.medium_tree()
|
|
>>> len(binary_tree)
|
|
7
|
|
>>> list(binary_tree)
|
|
[1, 2, 3, 4, 5, 6, 7]
|
|
"""
|
|
binary_tree = BinaryTree(Node(4))
|
|
binary_tree.root.left = two = Node(2)
|
|
two.left = Node(1)
|
|
two.right = Node(3)
|
|
binary_tree.root.right = five = Node(5)
|
|
five.right = six = Node(6)
|
|
six.right = Node(7)
|
|
return binary_tree
|
|
|
|
def depth(self) -> int:
|
|
"""
|
|
Returns the depth of the tree
|
|
|
|
>>> BinaryTree(Node(1)).depth()
|
|
1
|
|
>>> BinaryTree.small_tree().depth()
|
|
2
|
|
>>> BinaryTree.medium_tree().depth()
|
|
4
|
|
"""
|
|
return self._depth(self.root)
|
|
|
|
def _depth(self, node: Node | None) -> int: # noqa: UP007
|
|
if not node:
|
|
return 0
|
|
return 1 + max(self._depth(node.left), self._depth(node.right))
|
|
|
|
def is_full(self) -> bool:
|
|
"""
|
|
Returns True if the tree is full
|
|
|
|
>>> BinaryTree(Node(1)).is_full()
|
|
True
|
|
>>> BinaryTree.small_tree().is_full()
|
|
True
|
|
>>> BinaryTree.medium_tree().is_full()
|
|
False
|
|
"""
|
|
return self.root.is_full()
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|