MCPcopy Create free account
hub / github.com/Jack-Lee-Hiter/AlgorithmsByPython / findSuccessor

Method findSuccessor

BinarySearchTree.py:146–158  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

144 self.rightChild.parent = self.parent
145
146 def findSuccessor(self):
147 succ = None
148 if self.hasRightChild():
149 succ = self.rightChild.findMin()
150 else:
151 if self.parent:
152 if self.isLeftChild():
153 succ = self.parent
154 else:
155 self.parent.rightChild = None
156 succ = self.parent.findSuccessor()
157 self.parent.rightChild = self
158 return succ
159
160 def findMin(self):
161 current = self

Callers 1

removeMethod · 0.45

Calls 3

hasRightChildMethod · 0.45
findMinMethod · 0.45
isLeftChildMethod · 0.45

Tested by

no test coverage detected