Java Data Structures

The data structures supplied by the package java.util which are very powerful and performs a wide range of functions. These data structures consist of these interface and classes:

• Enumeration
• BitSet
• Stack
• Vector
• Hashtable
• Dictionary
• Properties

Enumeration

The Enumeration interface defines a way to retrieve the successive elements from a data structure.

BitSet

The class BitSet implements a group of bits or flags that can be set and cleared individually.

Stack

The Stack class implements a last-in-first-out (LIFO in short) stack of elements.

Vector

The Vector class is same as a traditional Java array, except that it can grow as necessary to accommodate the new elements.

Hashtable

The Hashtable class provides a means of organizing data based on some user-defined key structure.

Dictionary

The Dictionary class is an abstract class which defines a data structure for mapping keys to values.

Properties

Properties is a subclass of the Hashtable, used to maintain the lists of values in which the key and value also is a String

Java Online Test

---

« Previous Tutorial Next Tutorial »