recategorized by
685 views
1 votes
1 votes

We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. Total time required for this is

  1. $\Theta (\log n)$
  2. $\Theta (n)$
  3. $\Theta (n \log n)$
  4. $\Theta (n^{2})$
recategorized by

1 Answer

Answer:

Related questions

2 votes
2 votes
2 answers
2
admin asked Apr 2, 2020
1,064 views
A hash table with $10$ buckets with one slot per bucket is depicted. The symbols, $S1$ to $S7$ are initially emerged using a hashing function with linear probing. Maximum...
2 votes
2 votes
2 answers
3
admin asked Apr 2, 2020
783 views
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes