Next: 1.2 Complexity of Algorithms
Up: 1.1 Some Definitions
Previous: 1.1 Some Definitions
The following four data structures are used ubiquitously in the description
of algorithms and serve as basic building blocks for realizing more
complex data structures.
- Sequences (also called as lists)
- Dictionaries
- Priority Queues
- Graphs
Dictionaries and priority queues can be classified under a broader category
called dynamic sets. Also, binary and general trees are very popular
building blocks for implementing dictionaries and priority queues.
eEL,CSA_Dept,IISc,Bangalore