## Data Structure Name: Arrays - #### Description: - #### Variations: - Lists - [[Multi-dimensional Arrays]] - [[Sorted Array]] - #### Diagram: - #### General Use: ## Key Considerations - #### Properties: - Inserts and deletes are expensive - #### Implementation Details: - TBD | | | [[Big O - Time Complexity]] | [[Big O - Space Complexity]] | | --------- | ------------------- | --------------------------- | ---------------------------- | | Access... | *by index* | O(1) | | | Add... | *before first node* | O(N) | | | | *after given node* | O(N) | | | | *after last node* | O(1) | | | Delete... | *the first node* | O(N) | | | | *a given node* | O(N) | | | | *the last node* | O(1) | | | Search... | *a given node* | O(N) | | - #### General Tips - #### Special Properties ## Specific Use Cases - TBD