| 145 | return (this->Index & 3) != 3; // For a leaf 2 LSBs in index is 3 |
| 146 | } |
| 147 | T GetLeftChildIndex() const { return (this->Index >> 2); } |
| 148 | T GetRightChildIndex() const |
| 149 | { |
| 150 | // Right child node is adjacent to the Left child node in the data structure |
no outgoing calls
no test coverage detected