Sets: Sets are collections of unique elements with no specific order. They do not store key-value pairs like maps but focus on storing distinct values.
Hash Tables: Hash tables use hash functions to map keys to indices in an array-like structure called a hash table. This allows efficient lookup and insertion operations.
Trees: Trees are hierarchical data structures consisting of nodes connected by edges. They can be used to implement various types of maps such as binary search trees and AVL trees.