# Data Structure Data structure is a collection of values, organized for our usage. Each data structure is good and is specialized for its own thing. For example, in real world, we have bag to store books, we have fridge to store foods, etc * Arrays * Stacks * Queues * Linked Lists * Trees * Tries * Graphs * Hash Tables Each data structure has their [pros and cons](https://www.bigocheatsheet.com/). Some are good at certain operations, while others are good at other operations. What are data structure operation? * Insertion * Deletion * Traversal - access each data item exactly once so that it can be processed (like loop) * Searching - find out the location of the data item if it exists * Sorting * Access - How do we access this data --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://edsonha.gitbook.io/my-gitbook/data-structure-and-algorithm/data-structure.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.