a) Redundancy b) Robust c) Reliability d) None of these

a)  Weighted graph b)  Unweighted graph c)  Directed graph d)  Undirected graph

a)  Asymmetric b)  Symmetric c)  Distinct d)  Vary

a)  Cycle b)  Root c)  Tree d)  Sub tree

a) Vary b) Distinct c) Stable d) None of these.

a)  Edges b)  Cycles c)  Both a and b d)  None of these

a)  Complete binary tree b)  Binary search tree c)    Extended binary tree d)  None of above

a)  Yes just traverse through the array and form the tree b)  No we need one more traversal to form a tree c)  No in case of sparse trees d)  None of the mentioned

a)  64 b) 32 c)  128 d)  None of these

a)  very deep and narrow b)  very wide and shallow c)   very deep and very wide d)  cannot say

a)    2^d b)   [2^(d-1)]+1 c)    [2^(d+1)]+1 d)   (2^d)+1

a)  inorder b)  preorder c)  postorder d) any order

a)   n nodes. b)   (log2 n)nodes. c)    (2n-1) nodes. d)   2^n nodes.

a)    no left child b)   no right child c)    two children d)   no child

a)    n leaf nodes b)   n non-leaf nodes c)    (n-1) leaf nodes d)   (n-1) non-leaf nodes

 a)    Search and Insert Operations b)   Search and Delete Operations c)    Insert and Delete Operations d)   Search, Insert and Delete Operations