Question

List different types of nonlinear data structures.

Answer 1

• Tree: hierarchical structure (binary tree, binary search tree, AVL, red‑black, B‑tree, etc.).
• Heap: a tree‑based priority structure (binary heap, Fibonacci heap).
• Trie (prefix tree): tree for sequences/strings, fast prefix lookup.
• Graph: nodes (vertices) with edges (directed/undirected, weighted/unweighted) for general relationships.
• Hash table (hash map): associative structure using hashing for (average) O(1) lookup.