heap helper function get the position of the right child of the current node >>> get_child_right_position(0) 2
(position: int)
| 38 | |
| 39 | |
| 40 | def get_child_right_position(position: int) -> int: |
| 41 | """ |
| 42 | heap helper function get the position of the right child of the current node |
| 43 | |
| 44 | >>> get_child_right_position(0) |
| 45 | 2 |
| 46 | """ |
| 47 | return (2 * position) + 2 |
| 48 | |
| 49 | |
| 50 | class MinPriorityQueue[T]: |