Max Heap is the heap in which every node's key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.

Max Heap is the heap in which every node’s key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.

Min Heap is the heap in which every node's key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.

Min Heap is the heap in which every node’s key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.

In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes : 1. Shape 2. Order

In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes :
1. Shape
2. Order

It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.

It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.

An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary seaRead more

An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary search with a balance condition. The balance condition must be easy to maintain, and it ensures that the depth of the tree is O (log n). The simplest idea is to require that the left and right subtrees have the same height.

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution ofRead more

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution of the problem. There can be different algorithms to solve the same particular problem as a given solution solves only one problem at a time.

Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.

Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.

Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc

Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc

This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.

This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.

## What is Max Heap?

## Jyotika Sharma

Max Heap is the heap in which every node's key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.

Max Heap is the heap in which every node’s key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.

See less## What is Min Heap?

## Jyotika Sharma

Min Heap is the heap in which every node's key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.

Min Heap is the heap in which every node’s key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.

See less## What is Heap?

## Jyotika Sharma

In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes : 1. Shape 2. Order

In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes :

See less1. Shape

2. Order

## What is AVL Rotation?

## Jyotika Sharma

It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.

It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.

See less## What is Algorithm?

## Jyotika Sharma

An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary seaRead more

An AVL is another branch of trees, which is basically an extension to binary search tree(BST), which means to say that an AVL tree is basically a BST with some additional properties. The name AVL has given after the names of Adelson-Velskii and Landis, who gave this concept. AVL tree is a binary search with a balance condition. The balance condition must be easy to maintain, and it ensures that the depth of the tree is O (log n). The simplest idea is to require that the left and right subtrees have the same height.

See less## What is Algorithm?

## Jyotika Sharma

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution ofRead more

An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution of the problem. There can be different algorithms to solve the same particular problem as a given solution solves only one problem at a time.

See less## What is Searching?

## Jyotika Sharma

Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.

Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.

See less## What is Merging?

## Jyotika Sharma

Merging is a process of combining the records in two different files into a single file. It can be sorted based or un sorting based

Merging is a process of combining the records in two different files into a single file. It can be sorted based or un sorting based

See less## What is Sorting?

## Jyotika Sharma

Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc

Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc

See less## What is Deletion?

## Jyotika Sharma

This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.

This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.

See less