Home/ Questions/Q 8436245
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-10T07:07:47+00:00

Is there any Red Black Tree / AVL Tree data structure implementation in Java

  • 0

Is there any Red Black Tree /AVL Tree data structure implementation in Java collections/Guava/Apache Commons library ? If yes , can you point them to me . Basically I am looking for a data structure where the queries should happen in O(lg n) time . There will also be some updates to the data structure but not quite as often as the queries.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Basically I am looking for a data structure where the queries should
    happen in O(lg n) time

    Use a TreeMap. It is backed by a Red-Black tree so it’s access time is O(logN) (my emphasis on quote bellow)

    public class TreeMap
    extends AbstractMap implements
    NavigableMap, Cloneable, Serializable

    A Red-Black tree based NavigableMap implementation. The map is sorted
    according to the natural ordering of its keys, or by a Comparator
    provided at map creation time, depending on which constructor is used.

    This implementation provides guaranteed log(n) time cost for the
    containsKey, get, put and remove operations.

    • 0