()
| 37 | } |
| 38 | |
| 39 | findMinNode(): BinarySearchNode<T> { |
| 40 | let minNode: BinarySearchNode<T> | null = this.left; |
| 41 | while (minNode?.left) minNode = minNode.left; |
| 42 | return minNode ?? this; |
| 43 | } |
| 44 | |
| 45 | findMaxNode(): BinarySearchNode<T> { |
| 46 | let maxNode: BinarySearchNode<T> | null = this.right; |
no outgoing calls
no test coverage detected