Data Structures, Algorithms.
node has at most two children. Suitable for representing hierarchical relationships. Binary Search Trees (BST): Left child < Parent < Right child. Efficient for searching, insertion, and deletion operations. Graphs Graphs are collections of nodes connected by edges. They can be directed or