Page 203 - DCAP407_DATA_STRUCTURE

Data Structure

(b) An …………………tree is a binary search tree having a balance factor of every node as 0 or
+1 or −1.
(i) Huffman
(ii) Binary
(iii) Binary search
(iv) AVL

(c) The ………………… of the graph are used to represent objects.
(i) Arcs
(ii) Edge

(iii) Vertices
(iv) Directions
(d) The nodes which have the same parent node are known as ………………
(i) Root
(ii) Siblings
(iii) Left nodes
(iv) Right nodes
(e) The height of an empty tree is …………………

(i) 0
(ii) 1
(iii) -1
(iv) Null

10.8 Review Questions

1. “Choosing the best data structure for a program is a challenging task”. Discuss.
2. “The trees can be represented as graphs”. Justify.
3. “The height of a non-empty tree is the maximum level of a node in the tree”. Analyze.
4. “An undirected graph is a graph in which each edge has no direction”. Discuss with example.
5. “There are different kinds of trees and it is important to understand the difference between them”.
Analyze.
6. “An AVL tree is a binary search tree having a balance factor of every node as 0 or +1 or −1”.
Explain with diagram.
7. “A game tree is a graphical representation of a sequential game”. Explain with example.

196 LOVELY PROFESSIONAL UNIVERSITY