Vincent X

Let's begin by a trival example. A optimal `BST` with 8 nodes is drawn as follows: ``` Path Length Number of Nodes () 0 1 () () 1 2 ()()()()...

Let `path(x)` be the internal path length of a `BST` rooted at `x`. We have `path(null) = 0` and ```java path(x) = x.size - 1 + path(x.left) + path(x.right) ```...

False Positive of `reportUnnecessaryComparison` for Loop Variables

3

**Describe the bug & Code or Screenshots** In the following code, the loop condition `i != 10` is flagged by Pyright, while `j != 10` is accepted, even though both...