Array: Store homogenous elements. Store in contiguous locations. Fixed size not dynamic. Complexities Accessing O(1) Insertion and deletion O(n) worst case Searching O(n) sequential | O(nlogn) is sorted LinkedList Every entry is an object store data and reference of next object. Single LL Every node store reference of next node and last node NULL. Double... Continue Reading →

# Hierarchical Data Structure

Hierarchical Data Structure: Binary Tree Node can have at most two children Contain ROOT Node Every Node have following Reference of Left Node Reference of Right Node Data Traversal Depth First Traversal : In Order (LRtR) | Pre Order (RtLR) | Post Order (LRRt) Breadth First Traversal: Level Order Traversal Properties Max no of node... Continue Reading →