A priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements ‘1’ and ‘7’ are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is
(A) 10, 8, 7, 5, 3, 2, 1
(B) 10, 8, 7, 2, 3, 1, 5
(C) 10, 8, 7, 1, 2, 3, 5
(D) 10, 8, 7, 3, 2, 1, 5

Recent Topics

• Consider the following code fragment
  void foo(int x, int y)
  {
  x+=y;
  y+=x;
  }
  main()
  {
  int x=5.5;
  foo(x,x);
  }
  What is the final value of x in both call by value and call by reference, respectively?
  (A) 5 and 16
  (B) 5 and 12
  (C) 5 and 20
  (D) 12 and 20
  
  

  by 
  Anonymous

  1 year, 2 months ago

• Ionisation energy in group 1A varies in the decreasing order as 

  (a) Li > Na > K > Cs 

  (b) Na > Li > K >Cs 

  (c) Li > Cs > K > Na 

  (d) K > Cs > Na > Li

  by 
  Anonymous

  1 year, 3 months ago

• A clustering index is defined on the fields which are of type
  (A) non-key and ordering

  (B) non-key and non-ordering
  (C) key and ordering
  (D) key and non-ordering
  
  

  by 
  Anonymous

  1 year, 2 months ago
• Howare mining activities responsible for land degradation in jharkhand
  by 
  Anonymous

  1 year, 3 months ago

• What is the number of steps required to derive the string ((() ()) ())

  S → SSS → (S)S → ε

  (A) 10
  (B) 15
  (C) 12
  (D) 16
  
  

  by 
  Anonymous

  1 year, 3 months ago