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 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 of the above statements are true?
A) 1,2 B)3,4 C)1,2,3 D)1,2,3,4.
Answer C.
2. Pre order.post order and inorder are used to list the vertices of an ordered rooted tree.
3. Huffman 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 of the above statements are true?
A) 1,2 B)3,4 C)1,2,3 D)1,2,3,4.
Answer C.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.