Forum on discussion binary heap

Answer the question

Answer the question

by Md Assaduzzaman -
Number of replies: 54

1, What is binary heap?

2. Why it is important in computer science

In reply to Md Assaduzzaman

Re: Answer the question

by Shohanur Rahman 201-15-3401 -

#Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.

In reply to Md Assaduzzaman

Re: Answer the question

by Sabbir Hossain Antar -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by ABU BAKAR SIDDIQUE 201-15-3352 -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Maherunnesa Mim -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Arpita Ghosh 201-15-3422 -
Ans: to the Ques: No.01
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


Ans: to the Ques: No.02
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Md.Majedul Haque Tanin -
# Ans to the question number 1-

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


# Ans to the question number 2-


For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Ismotara Dipty -

Answer ti the question no 1:

A binary heap is a data structure, which looks similar to a complete binary tree.


Answer to the question no 2 :


Heaps are used in many famous algorithms such as Dijkstra's algorithm for finding the shortest path, the heap sort sorting algorithm, implementing priority queues, and more. Essentially, heaps are the data structure you want to use when you want to be able to access the maximum or minimum element very quickly.For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.

In reply to Md Assaduzzaman

Re: Answer the question

by 201-15-3532 Sumaiya Haider -
1.Ans-A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.
2.Ans-For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Avishek Das (201-15-3452) -

Ans: to the Ques: No.01

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.



Ans: to the Ques: No.02

A Binary Heap is a Binary Tree with following properties.

  •  It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.


  • A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to Min-heap .
In reply to Md Assaduzzaman

Re: Answer the question

by Md. Seyam Ali Biswas -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Taslima Jahan Tushi 201-15-3269 -

Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.

In reply to Md Assaduzzaman

Re: Answer the question

by Arif Hosen -
1) Ans: A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

2) Ans: For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Sanjida Zaman Toma 201-15-3102 -
01:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

02:
For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Dipta bhowmik15-3425 -
Answer to the question no 1:
A binary heap is a data structure, which looks similar to a complete binary tree. Heap data structure obeys ordering properties discussed below.
Answer to the question no 2:
For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Khatuna Jannat Sarnali -
1 No Answer

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

2 No Answer:

The binary heap is a data structure that will help us implement a priority queue with fast operations. This means we want to be able to quickly insert objects into the heap with different priority values, and we want to be able to quickly remove the most important item quickly.
In reply to Md Assaduzzaman

Re: Answer the question

by Mafujul Haque Plabon -
Answer to the question no (1)

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

Answer to the question no (02)

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Ahmed Ishtiak Nihal -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Mohammad Nadiatul Islam Sakib -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Ibrahim Tasin -

Answer to the question no. 1

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

Answer to the question no. 2

For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Md. Shahin Alam -
Answer to the question no (1)

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

Answer to the question no (02)

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Muhammad Nur-A-Alam -
Answer to the question no (1)

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

Answer to the question no (02)

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Sabrina Sultana -
Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Sajib Bormon 201-15-3773 -
Answer to the ques no: 1

Heap is a complete binary tree data structure where the root-node key is compared with its children and arranged accordingly.

Answer to the ques no: 2

It's an efficient structure for sorting. Putting the value a heap gives them a loose ordering, but the lowest value is always at the root, so as you remove them it gives the values back in order.

It's also a good choice to implement a priority queue. You add values in based on their priority, and you will get them back out in order of priority. This is much more efficient than trying to maintain a dully sorted list at every step.
In reply to Md Assaduzzaman

Re: Answer the question

by R.M. Sifat 201-15-3427 -
Answer: 01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by 201-15-3293 Abdur Razzak -
#Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Atikur Mithun -

Answer to the question number:1

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

Answer to the question number:2

 For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.

In reply to Md Assaduzzaman

Re: Answer the question

by 201-15-3255 Al Imran Alvy -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Md. Farhatul Haider -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by 201-15-3417 Arpita Basak -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Sumia Sarower Trisha 201-15-3474 -

1)ANS:

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

2)ans:

For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).

In reply to Md Assaduzzaman

Re: Answer the question

by Ordha Nafiz Akbar -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Akteruzzaman 201-15-3139 -
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Anika Nawar -
#Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.

Picture of Sabbir Hossain Antar
In reply to Md Assaduzzaman
Re: Answer the question
by Sabbir Hossain Antar - Sunday, 6 December 2020, 6:18 PM
Picture of DS-(PC-E)
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by 201-15-3311 Mehedi -
#Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Arnab Saha -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Prayma Bishshash 201-15-3168 -
answer to the question no 1:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

answer to the question no 2:
For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Sazzad Hosain Sagor -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by RIFAT JAHAN ZIM 201-15-3611 -

Answer: 01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.

In reply to Md Assaduzzaman

Re: Answer the question

by Tapu Chandra Malo -
Ans to the Q.No-1

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

Ans to the Q.No-2

For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Jannatul Ferdous Moon -
Ans to the question no : 01

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

Ans to the question no: 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Nabid Anjum Ome 201-15-3308 -
01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority
In reply to Md Assaduzzaman

Re: Answer the question

by Mohammad Ashikuzzaman 3438 -
Answer to the question No:-01

A binary heap is a data structure, which looks similar to a complete binary tree.



Answer to the question No:-02



Heaps are used in many famous algorithms such as Dijkstra's algorithm for finding the shortest path, the heap sort sorting algorithm, implementing priority queues, and more. Essentially, heaps are the data structure you want to use when you want to be able to access the maximum or minimum element very quickly.For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Amir Hamza Shuvo 201-15-3397 -
1.Ans-A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.
2.Ans-For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Arifa Rahman Tony -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI
In reply to Md Assaduzzaman

Re: Answer the question

by Md.Yeasin Chowdhury 201-15-3443 -
Answer :01
A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

Answer :02
For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Md. Sakibuzzaman Alif -
1)ANS:
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.
2)ans:
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Ibrahim Tasin -

Answer to the question no. 1

A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


Answer to the question no. 2

A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Mst Naima Sultana -

01.
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


02.
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.

In reply to Md Assaduzzaman

Re: Answer the question

by Rimon Rimon -
Ans: 01
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


Ans:02
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Nujhat Tabassum(201-15-3363) -
(1)Answer: A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.


(2) Answer: Heaps are also crucial in several efficient graph algorithms such as Dijkstra's algorithm. When a heap is a complete binary tree, it has a smallest possible height—a heap with N nodes and for each node a branches always has loga N height.
In reply to Md Assaduzzaman

Re: Answer the question

by Tania Ahmed Nipa (201-15-3282) -
Ans to the question number -1
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.

Ans to the question number-2
For starting Binary tree is always important. For example, binary trees are used for Heap sorting (Binary Heap). This is way for very fast sorting data so that the biggest (or lowest) item always is at the front. This is used for example in AI (A* algorithm).
In reply to Md Assaduzzaman

Re: Answer the question

by Janatul Naeem (201-15-3605) -
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues.


Ans: to the Ques: No.02
A Binary Heap is a Binary Tree with following properties.
1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to MinHeap.
In reply to Md Assaduzzaman

Re: Answer the question

by Janatul Naeem (201-15-3605) -
Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.



Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.
In reply to Md Assaduzzaman

Re: Answer the question

by Zannatul Mawya Priya 201-15-3209 -
#Answer for question- 01

A binary heap could be a heap system that takes the shape of a binary tree. Binary heaps are a standard way of implementing priority queues.

#Answer for question- 02

For instant access to the foremost important value within the case of a Max Heap or the tiniest value within the case of a Min Heap. By “instant access” I mean constant time or O(1) for you computer scientists. This just implies that we all know where the value is visiting be which is within the muse of the tree or at the beginning of the array, hoping on which system you're using. Useful for priority rows and schedules, where the first item is prioritized. An exercise for this could be prioritizing patients at a hospital to figure on with the foremost effective priority.