Question

Which kind of tree is used to implement TreeMap in Java?

Option 1: AVL Tree
Option 2: Red-Black Tree
Option 3: Binary Search Tree (BST)
Option 4: B-Tree

Answer 1

TreeMap in Java is implemented using a Red-Black Tree, a self-balancing binary search tree.

Step-by-step explanation:

In Java, the TreeMap class is implemented using a Red-Black Tree.

A Red-Black Tree is a self-balancing binary search tree that ensures all operations take O(log n) time, providing efficient key-value mapping.

Other options such as AVL Tree, Binary Search Tree (BST), and B-Tree are different types of self-balancing binary search trees but are not used to implement TreeMap in Java.