(Object key)
| 311 | } |
| 312 | |
| 313 | public Node entryAt(Object key){ |
| 314 | Node t = tree; |
| 315 | while(t != null) |
| 316 | { |
| 317 | int c = doCompare(key, t.key); |
| 318 | if(c == 0) |
| 319 | return t; |
| 320 | else if(c < 0) |
| 321 | t = t.left(); |
| 322 | else |
| 323 | t = t.right(); |
| 324 | } |
| 325 | return t; |
| 326 | } |
| 327 | |
| 328 | public int doCompare(Object k1, Object k2){ |
| 329 | // if(comp != null) |
no test coverage detected