Data Structure

Tree Search

Searches specific data in a tree to check it is present or not.

Queue IsEmpty

Check if the queue is empty

Queue IsFull

Check if the queue is full

Stack IsEmpty

Check if the stack is empty

Stack IsFull

Check if the stack is full

Linear Data Structure

Data structure in which data elements are arranged sequentially or linearly, where each element is attached to its previous and next adjacent elements, is called a linear data structure.

Non-linear Data Structure

Data structures where data elements are not placed sequentially or linearly are called non-linear data structures.

Queue Peek

Get the value of the front of the queue without removing it

Stack Peek

Get the value of the top element without removing it

Dynamic data structure

the size is not fixed. It can be randomly updated during the runtime which may be considered efficient concerning the memory (space) complexity of the code.

Examples of non-linear data structures

trees and graphs

Array Updating

updates element at given index

Enqueue

Add an element to the end of the queue

Push

Add an element to the top of a stack

Tree Insert

Inserts data in a tree.

Dequeue

Remove an element from the front of the queue

Pop

Remove an element from the top of a stack

Linked List Deletion

To delete nodes from specific positions.

Linked List Insertion

To insert new nodes at specific positions.

Linked List Searching

To search for an element from the linked list.

Linked List Traversing

To traverse all nodes one by one.

Each node contains

a data field and a reference(link) to the next node in the list

Stack

a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Graph

a non-linear data structure consisting of vertices and edges.

Array Inserting

adds element at given index

Primitive data structure

also known as built-in data types can store the data of only one type. You know the integers, floating points, characters, pointers, stuff like that.

Non-primitive data structures

can store data of more than one type. For example, array, linked list, stack, queue, tree, graph, and so on. These are often referred to as derived data types.

Array Merging

combine two or more set of array together

Tree Create

create a tree in data structure.

Queue

defined as a linear data structure that is open at both ends and the operations are performed in First In First Out (FIFO) order.

Arrays

defined as the collection of similar types of data items stored at contiguous memory locations.

Array Deleting

delete an element at given index

Edges

drawn or used to connect two nodes of the graph

Array, stack, queue, and linked list

examples of linear data structures

Static data structure

has a fixed memory size. It is easier to access the elements.

Linked list

is a linear data structure, in which the elements are not stored at contiguous memory locations.

Data structure

is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently. It is also used for processing, retrieving, and storing data.

The non-primitive data structures are further classified into

linear and non-linear

Linked list consists of what?

nodes

Tree

non-linear and a hierarchical data structure consisting of a collection of nodes such that each node stores a value and a list of references to other nodes (the "children").

Array Sorting

organize elements of array

Tree Post order Traversal

perform Traveling a tree in a post-order manner.

Tree Preorder Traversal

perform Traveling a tree in a pre-order manner in data structure .

Tree In order Traversal

perform Traveling a tree in an in-order manner.

Array Traversing

prints all array elements

Array Searching

searches for an element using value or given index

Vertices

sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph