MCPcopy
hub / github.com/Jack-Lee-Hiter/AlgorithmsByPython / findMin

Method findMin

AVL.py:225–229  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

223 return succ
224
225 def findMin(self):
226 current = self
227 while current.hasLeftChild():
228 current = current.leftChild
229 return current
230
231 def remove(self, currentNode):
232 if currentNode.isLeaf(): # leaf

Callers 1

findSuccessorMethod · 0.45

Calls 1

hasLeftChildMethod · 0.45

Tested by

no test coverage detected