5 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 366
Correct 49
Incorrect 101
Viewed 216

Answers

Guest
Guest
Serkie Mekonnen
Serkie Mekonnen - 4 days 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 - 1 month 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 - 1 month ago

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

Uga Balu
Uga Balu - 1 month ago

Uga Balu from Chennai, India is saying Depth first search can be used to find connected components of a graph. is correct answer

uma
uma - 1 month ago

uma from Hindupur, India is saying Breath first search cannot be used to find converted components of a graph. is correct answer

Related Questions

A vertex of degree one is called

  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex