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...

Answers

Guest

Related Questions

Davinder Singh - 4 years ago in Data Structure
The postfix expression for * + a b - c d is?
  • [A] ab + cd - *
  • [B] ab cd + - *
  • [C] ab + cd * -
  • [D] ab + - cd *
Davinder Singh - 4 years ago in Data Structure
Merge sort uses ?
  • [A] Divide and conquer strategy
  • [B] Backtracking approach
  • [C] Heuristic search
  • [D] Greedy approach
Davinder Singh - 4 years ago in Data Structure
A vertex of degree one is called
  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex