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

Function get_left_most

data_structures/binary_tree/avl_tree.py:189–195  ·  view source on GitHub ↗
(root: MyNode)

Source from the content-addressed store, hash-verified

187
188
189def get_left_most(root: MyNode) -> Any:
190 while True:
191 left_child = root.get_left()
192 if left_child is None:
193 break
194 root = left_child
195 return root.get_data()
196
197
198def del_node(root: MyNode, data: Any) -> MyNode | None:

Callers 1

del_nodeFunction · 0.85

Calls 2

get_leftMethod · 0.80
get_dataMethod · 0.80

Tested by

no test coverage detected