Data Structures Notes

This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...

This algorithm comes under the greedy method, which means that the objects are chosen to join a growing collection by iteratively picking an...

The binary tree are applicable in the below mentioned fields: - Used in the compilers of high-level programming languages for intermediate r...

Given data items: 17, 6, 3, 9 ,12, 15, 1, 18, 22 The resulting binary tree is:

A binary tree embodies a finite set of data items that is either empty or partitioned into three disjoint subsets. The first part contains a...

A strictly binary tree of depth 'd' in which all the leaves are at level 'd' i.e. there is non empty left or right subtrees ...

Hashing is the process of mapping large amount of data item to a smaller table with the help of a hashing function . The essence of hashing...

Network refers to a graph in which the edges are bound with weights. Here weights can be numbers assigned to a the edges. Hence, a graph of ...

There are two possible traversal methods for a graph: i. Breadth-First Traversal ii. Depth-First Traversal i. Breadth-First Traversal : Tra...

There two types of graphs: i. Undirected Graphs ii. Directed Graphs Undirected Graph : A graph that entail edges with ordered pair of vertic...

Graph is an Abstract Data Type ( ADT ) which is of a non-linear structure entailing sets of nodes and connectors. Here, the connectors helps...

Bucket Sort (alternatively know as bin sort) is an algorithm that sorts numbers and comes under the category of distribution sort. This sort...

Radix Sort is an algorithm that sorts a list of numbers and comes under the category of distribution sort. This sorting algorithm doesn'...

Heap Sort is a sorting algorithm that sorts data items into ascending or descending order, which comes under the category of comparison-base...

Quick Sort is a sorting algorithm that sorts data items into ascending or descending order, which comes under the category of comparison-ba...

Merge sort is a sorting algorithm that sorts data items into ascending or descending order, which comes under the category of comparison-bas...

Selection Sort is a sorting algorithm that sorts data items into ascending or descending order, which comes under the category of in-place ...

Bubble sort is a sorting algorithm that sorts data items. These data items are presumed to be arranged in a sequential order (i.e. like an a...

A non-linear data structure is a data structure in which a data item is connected to several other data items. So that a given data item ha...

Linear datastructure is one in which the data items are placed in the memory contiguously i.e. one after the other. Pros If we search the fi...