in Algorithms edited by
1,820 views
3 votes
3 votes

Consider the following statements:

  1. Depth-first search is used to traverse a rooted tree
  2. Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
  3. Huffman's algorithm is used to find an optimal binary tree with given weights
  4. Topological sorting provides a labelling such that the parents have larger labels than their children

Which one of the above statements is true?

  1. a and b
  2. c and d
  3. a, b, and c
  4. a, b, c, and d
in Algorithms edited by
1.8k views

1 Answer

1 vote
1 vote
Best answer
all statements are TRUE

answer D
selected by
by

1 comment

Please explain the last statement.
0
0
Answer:

Related questions