Question 71 : The number of trees in a binomial heap with n nodes is
1. logn
2. n
3. nlogn
4. n/2
View Answer   Discuss with Members

Question 72 : What is the process of building a ternary heap called?
1. Heapify
2. Hashing
3. Linking
4. Merging
View Answer   Discuss with Members

Question 73 : An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
1. O(n*n*logn)
2. O(n*logn)
3. O(n*n)
4. O(n *logn *logn)
View Answer   Discuss with Members

Question 74 : What is the time complexity for inserting a new item in a ternary heap of n elements?
1. O (log n/ log 3)
2. O (n!)
3. O (n)
4. O (1)
View Answer   Discuss with Members

Question 75 : Why is this heap named leftist heap?
1. only left subtrees exist
2. the tree is biased to get deep down the left
3. it is balanced
4. right trees are unbalanced
View Answer   Discuss with Members

Question 76 : What is the location of parent node for any arbitary node i?
1. (i/2) position
2. (i+1)/ position
3. floor(i/2) position
4. ceil(i/2) position
View Answer   Discuss with Members

Question 77 : The worst case complexity of deleting any arbitrary node value element from heap is
1. O(logn)
2. O(n)
3. O(nlogn)
4. O(n²)
View Answer   Discuss with Members

Question 78 : What is the worst case time in searching minimum value in weak -heap?
1. O(log n)
2. O(n)
3. O(n logn)
4. O(1)
View Answer   Discuss with Members

Question 79 : What happens if the null path length is not updated?
1. error occurs
2. all null path lengths will be 0
3. all null path lengths will be -1
4. all null path lengths will be 1
View Answer   Discuss with Members

Question 80 : The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.
1. True
2. False
3.
4.
View Answer   Discuss with Members