6 years ago in Data Structure

Which of the following statement is true ?

[A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
[B] Breath first search cannot be used to find converted components of a graph.
[C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
[D] Depth first search can be used to find connected components of a graph.
Loading...
Next Question

Overall Stats

Attempted 370
Correct 50
Incorrect 102
Viewed 218

Answers

Guest
Guest
Abdelrahman S. Fathy
Abdelrahman S. Fathy - 3 months ago

Abdelrahman S. Fathy from Cairo, Egypt is saying Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe is correct answer

Sanju Rebel
Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying Optimal binary search tree construction can be performed efficiently using dynamic programming. is correct answer

Serkie Mekonnen
Serkie Mekonnen - 7 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying Depth first search can be used to find connected components of a graph. is correct answer

Marem Husen
Marem Husen - 8 months ago

Marem Husen from Al Musayyib, Iraq is saying Optimal binary search tree construction can be performed efficiently using dynamic programming. is correct answer

deepak kumar
deepak kumar - 9 months ago

deepak kumar is saying Breath first search cannot be used to find converted components of a graph. is correct answer

Related Questions

Queue can be used to implement ?

  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort

An IP address is a numeric quantity that identifies -

  • [A] a network adapter to other devices on the network
  • [B] the manufacturer of a computer
  • [C] the physical location of a computer
  • [D] none of the above

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

  • [A] 2 deletions and 3 additions
  • [B] 3 additions and 2 deletions
  • [C] 3 deletions and 3 additions
  • [D] 3 deletions and 4 additions