Returns inorder successor of any node
(self, node, a)
| 426 | return self.__find(self.root, a) |
| 427 | |
| 428 | def findInorderSucc(self, node, a): |
| 429 | """ Returns inorder successor of any node """ |
| 430 | self.lastSearchDepth = 0 |
| 431 | if node.isLeafNode(): |
| 432 | return node |
| 433 | new_node = node.chooseChild(a + 1) |
| 434 | return self.__nextSucc(new_node) |
| 435 | |
| 436 | def insertValue(self, a): |
| 437 | """ Inserts a new value to tree and keeps it balanced """ |
no test coverage detected