Davinder Singh
Davinder Singh - 4 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...

Overall Stats

Attempted 332
Correct 39
Incorrect 85
Viewed 208

Answers

Guest
Guest
Mital Patel
Mital Patel - 1 month ago

Mital Patel from Ahmedabad, India is saying Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe is correct answer

Haranadh Banda
Haranadh Banda - 7 months ago

Haranadh Banda from Vijayawada, India is saying Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe is correct answer

Jawad Awan
Jawad Awan - 7 months ago

Jawad Awan from Jamshoro, Pakistan is saying Depth first search can be used to find connected components of a graph. is correct answer

akanksha singh
akanksha singh - 8 months ago

akanksha singh from Vadodara, India is saying Depth first search can be used to find connected components of a graph. is correct answer

monika
monika - 8 months ago

monika from India is saying Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe is correct answer

Related Questions

Davinder Singh
Davinder Singh - 4 years ago in Data Structure
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