edited by
2,199 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. $\text{i and ii}$
  2. $\text{iii and iv}$
  3. $\text{i, ii, and iii}$
  4. $\text{i, ii, iii, and iv}$
edited by

1 Answer

Best answer
1 votes
1 votes
all statements are TRUE

answer D
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 30, 2016
2,059 views
Level order Traversal of a rooted Tree can be done by starting from root and performing:Breadth First SearchDepth First SearchRoot SearchDeep Search
0 votes
0 votes
4 answers
2
go_editor asked Jul 31, 2016
3,907 views
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...
2 votes
2 votes
1 answer
3
go_editor asked Jul 30, 2016
5,997 views
To determine the efficiency of an algorithm the time factor is measured byCounting micro secondsCounting number of key operationsCounting number of statementsCounting kil...
3 votes
3 votes
1 answer
4