The Gateway to Computer Science Excellence
+2 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 by
edited by | 942 views

1 Answer

+1 vote
Best answer
all statements are TRUE

answer D
selected by
Please explain the last statement.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,484 answers
95,291 users