()
| 3951 | } |
| 3952 | |
| 3953 | TreeMap.Entry<K, V> findBiggestEntry() { |
| 3954 | if (null != root){ |
| 3955 | Node<K, V> node = maximum(root); |
| 3956 | TreeMap.Entry<K, V> ret = new TreeMap.Entry<K, V>(node.keys[node.right_idx], node.values[node.right_idx]); |
| 3957 | ret.node = node; |
| 3958 | ret.index = node.right_idx; |
| 3959 | return ret; |
| 3960 | } |
| 3961 | return null; |
| 3962 | } |
| 3963 | |
| 3964 | TreeMap.Entry<K, V> findCeilingEntry(K key) { |
| 3965 | if (root == null) { |
no test coverage detected