{
    "api": "YAML JSON TOON Database",
    "version": "1.0.0",
    "format": "json",
    "dataset": {
        "id": 378,
        "slug": "complexity-analysis",
        "title": "Data Structure Complexity Analysis",
        "description": "Time and space complexity analysis of common data structures: Array, Linked List, Binary Search Tree, Hash Table, Heap, and Graph with Big-O notation.",
        "category": "Data Structures",
        "category_slug": "data-structures",
        "tags": "algorithms,complexity,big-o,data structures",
        "view_count": 1,
        "created_at": 1781275786,
        "updated_at": 1781275786
    },
    "data": {
        "structures": [
            {
                "name": "Array",
                "access": "O(1)",
                "search": "O(n)",
                "insertion": "O(n)",
                "deletion": "O(n)",
                "space": "O(n)"
            },
            {
                "name": "Linked List",
                "access": "O(n)",
                "search": "O(n)",
                "insertion": "O(1)",
                "deletion": "O(1)",
                "space": "O(n)"
            },
            {
                "name": "Binary Search Tree",
                "access": "O(log n)",
                "search": "O(log n)",
                "insertion": "O(log n)",
                "deletion": "O(log n)",
                "space": "O(n)"
            },
            {
                "name": "Hash Table",
                "access": "N\/A",
                "search": "O(1)",
                "insertion": "O(1)",
                "deletion": "O(1)",
                "space": "O(n)"
            },
            {
                "name": "Heap",
                "access": "O(1) max",
                "search": "O(n)",
                "insertion": "O(log n)",
                "deletion": "O(log n)",
                "space": "O(n)"
            },
            {
                "name": "Graph (Adjacency List)",
                "access": "O(1)",
                "search": "O(V+E)",
                "insertion": "O(1)",
                "deletion": "O(V+E)",
                "space": "O(V+E)"
            }
        ]
    }
}