Home/ Questions/Q 6900857
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T07:35:59+00:00

I am interested in such a question: as we know, Red-Black tree provides efficient

  • 0

I am interested in such a question: as we know, Red-Black tree provides efficient implementation of such operations as successor (the first element higher that entry) and predecessor , i.e. in log – time.
In Java documentation is written that for providing such operation as successor you may merely use subSet and then took the least element in the subSet. But is it log-time? If it is, what is the implementation of subSet?(I am interested in the algorithm, so it may be just few words, not necessary code)

Thanks.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I would just read the code to see how it works.

    I believe subSet is O(log N) A more natural approach would be to use the lower(E) and higher(E) methods which is designed to do this.

    http://docs.oracle.com/javase/7/docs/api/java/util/NavigableSet.html

    • 0