Register

#binary heap

991 views

1 Answer

0 0 votes
In the tree indexing is started from root and continue to next level from left to right.

So, index of node 50 is: 0

       index of node 40 is: 1

       index of node 60 is: 2

and so on.
Voting & Accepting an answer helps improve the community
← Previous · Probability - Inclus...Next → · #self doubt
← Previous in category · MCQs in ComputerNext in category → · Programming in c
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.7k
1.7k views
iarnav asked Jun 19, 2018
1,676 views
#Binary Max Heap Question (Doubt)
Let's say we're given with a MAX Heap and we want to delete any of the leaf node, then how much time will it take to delete any of the leaf node and maintain the max heap...
3 3 votes
1 1 answer
967
967 views
Hira Thakur asked Jan 1, 2019
967 views
HEAP (MAX/MIN HEAP)
what is the time complexity of various problems such as:1) Creating the heap2) Getting maximum element in the max heap3) Getting minimum element in the max heap4) Getting...
5 5 votes
0 0 answers
1.2k
1.2k views
vamp_vaibhav asked Dec 29, 2017
1,158 views
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
0 0 votes
0 0 answers
2.1k
2.1k views
Shubhanshu asked Oct 18, 2017
2,068 views
Data Structure: Find 7th smallest element in Min heap
In a binary min heap with n elements, the 7th smallest element can be found in _____ ?Answer given is O(logn) and solution:-Delete the 1st smallest element O(logn)Delete ...