Given a heap of n nodes.The maximum number of tree for building the heap is.
(a) n
(b) n-1
(c) n/2
(d) logn
My question is based upon Binomial and Fibonacci Heap topic in chapter Heap of Data Structures & Algorithms I
I had been asked this question by my school principal while I was bunking the class.