Features
Features:

Product Tour >

Edraw AI >

Paid Plans:

Individuals >

Business >

Eduaction >
Resources
Blog

History

How-tos & Tips

Discovery

Biography

Business Analysis

Examples

AI concept Map

Free AI Mind Map Generator

Onenote Mind Map

Bcg Matrix Examples

Nike Marketing Strategy

Unilever SWOT Analysis

Make Mind Maps in Google Docs

Guide

FAQs

What's New

Resource Center
Templates
All Templates

Brain Storming Templates

Strategy and Planning Templates

Project Management Templates

Product Management Templates

Human Resources Templates

Agile Workflow Templates

Marketing Templates

Education Templates

Fun and Games Templates

User Gallery
Download
Pricing
Enterprise

data structure

Data refers to the representation of objects, that is, the representation of facts, concepts, or instructions formed in a manner suitable for communication interpretation or processing, the logical relationships between data elements, and the logical description of data, regardless of data storage.

Edited at 2022-07-01 20:23:22

PlotWizard

Recent works View more works>>

data structure

PlotWizard

Recent works View more works>>

Recommended to you
Outline

Jida data structure

introduction

data

Concept: refers to the representation of an object, that is, a representation of a fact, concept, or instruction in a manner suitable for communication interpretation or processing.

Data is just representation, not meaning

Data elements (or data components): can be called element nodes or vertices

The smallest unit of data is the data item

logical structure of data

The logical relationship between data elements, which describes the data logically and has nothing to do with data storage.

Linear structure (linear table)

General linear table

stacks and queues

string

Array, generalized list

nonlinear structure

gather

tree structure

number of shares

Binary tree

graph structure

directed graph

Undirected graph

Data storage structure (physical structure)

order(array)

Links (for example, a linear table can be stored in a chained manner)

index

hash

In the adjacency list representation of a graph, sequential storage is generally used for vertex tables, while link storage is commonly used for edge tables.

Linear tables can use sequential storage or chain storage. Explain the advantages and disadvantages of these two storage methods?

Operations on data structures

insert

delete

Revise

sort

Find

algorithm

time complexity

0(1)

0(n)

0(logN)

0(n^2)

linear table

basic concept

A linear list is an ordered set of zero or more nodes of the same type.

Represents: (a0,a1,...an-1)

Basic operations

Create a linear table

InitList(&L)

insert operation

ListInsert(&L,i,e)

Delete operation

ListDelete(&L,i,e) e is the returned element value

Find, modify operations

LocateElem(L,e): Search by value

GetElem(L,i): bitwise search

Destroy linear table

&DestroyList(&L)

Other common operations

Ask for table length

Length(L)

Output operations

Printlist(L)

Empty judgment operation (determining whether the linear table is empty)

Empty(L)

sequential storage

Data that are logically adjacent are also physically adjacent and require a continuous storage area.

Advantages and Disadvantages Analysis: Random access can be achieved, and each storage unit only stores data, but insertion and deletion operations require a large number of moving elements.

Linked storage

Data that are logically adjacent are not necessarily physically adjacent and do not require continuous storage areas.

Analysis of advantages and disadvantages: The chain storage method does not support random access. In addition to storing data, each storage unit also needs to store attached pointers, which requires a large space overhead. However, insertion and deletion do not require moving a large number of elements, only the pointers need to be modified.

Type: singly linked list, doubly linked list, circular linked list

Algorithm implementation

C language

ADL