A special format for storing ang organizing data

Logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented

The data and the operation

The representation and the implementation

Used for storing elements where each element is a seperate object

Represents a hierarchical nature of a structure in graphical form

A special type of queue where elements are processed based on their order (natural or custom)

A complete binary tree where each parent node is either higher or lower than the value of its child nodes

A collection of elements where each element is unique

Set of elements where each element is known as keys(identifiers) and values(constants)

Consists of vertices and set of edges between the pair of vertices

An algorithm should have zero or more well defined data before the algorithm begins

An algorithm must have one or more results with relation to the input

The results of each step depends on the input and the result of the previous step

Repeat an action multiple times

Function calls itself once or multiple times to solve a problem

Any function that calls itself

A problem is broken into smaller subproblems

The optimal approach is always chosen in oroblek solving

Similar to divide and conquer except the results of the subproblems are reused in overlapping subproblems

Recursion that involves a method directly calling itself

When a method invokes another method, eventually resulting in the original method being invoked again

When a recursive function fails to stop recursion

Process of repeating a set of instructions, also known as looping

The function calls itself once each time it is invoked

The function makes a recursive call as its very last operation

The function calls itself twice in the run of the function

The function works in pair or a group

Elements in a linked list

This contains the value of the element

This contains the address of the next node

The next node is the list

First node in the list

Where the last node points to since there are no successive elements

Shows the element on the list

Adds element into the list

Removes a specific element or all the elements in the list

Returns the number of elements in the list

The basic linked list

Contains am extra pointer to connect the previous node in the sequence