MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / MyNode

Class MyNode

data_structures/binary_tree/avl_tree.py:43–72  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

41
42
43class MyNode:
44 def __init__(self, data: Any) -> None:
45 self.data = data
46 self.left: MyNode | None = None
47 self.right: MyNode | None = None
48 self.height: int = 1
49
50 def get_data(self) -> Any:
51 return self.data
52
53 def get_left(self) -> MyNode | None:
54 return self.left
55
56 def get_right(self) -> MyNode | None:
57 return self.right
58
59 def get_height(self) -> int:
60 return self.height
61
62 def set_data(self, data: Any) -> None:
63 self.data = data
64
65 def set_left(self, node: MyNode | None) -> None:
66 self.left = node
67
68 def set_right(self, node: MyNode | None) -> None:
69 self.right = node
70
71 def set_height(self, height: int) -> None:
72 self.height = height
73
74
75def get_height(node: MyNode | None) -> int:

Callers 1

insert_nodeFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected