Page 204 - DCAP407_DATA_STRUCTURE

Unit 10: Trees

8. “A graph in which each edge is assigned a direction is called a directed graph”. Discuss with
example.
9. “A board which initially contains a pile of n toothpicks describes the Nim game”. Analyze.
10. “A graph consists of a set of vertices and edges/arcs”. Explain with diagram.
11. “There are two ways to represent trees”. Discuss in detail.
12. “There are sequences of steps to be followed to construct a Huffman tree”. Explain with example.
13. “Every 3-node in a 2-3 tree must have specific properties”. Discuss with diagram and example.

Answers: Self Assessment

1. (a) True
(b) True
(c) False
(d) True
(e) False
(f) True

2. (a) Binary search tree
(b) 2-node and 3-node
(c) Root
(d) Data
(e) Mixed
3. (a) Binary
(b) AVL
(c) Vertices

(d) Siblings
(e) -1

LOVELY PROFESSIONAL UNIVERSITY 197