()
| 43 | } |
| 44 | |
| 45 | findMaxNode(): BinarySearchNode<T> { |
| 46 | let maxNode: BinarySearchNode<T> | null = this.right; |
| 47 | while (maxNode?.right) maxNode = maxNode.right; |
| 48 | return maxNode ?? this; |
| 49 | } |
| 50 | |
| 51 | findSuccessorNode(): BinarySearchNode<T> | null { |
| 52 | if (this.right !== null) return this.right.findMinNode(); |
no outgoing calls
no test coverage detected