Please explain the last statement.

The Gateway to Computer Science Excellence

+2 votes

Consider the following statements:

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

Which one of the above statements is true?

- a and b
- c and d
- a, b, and c
- a, b, c, and d

52,345 questions

60,484 answers

201,813 comments

95,291 users