View Count: 0 Duration: 27 mins Accessed date: Not Yet Viewed View Count: 0 Duration: 51 mins Accessed date: Not Yet Viewed View Count: 0 Duration: 38 mins Accessed date: Not Yet Viewed
###### Post your comment / feedback here

 Sorry!For this module there is no Sample Code.
Question No: 1 of 12
`The node that has no children is referred as: `
Options:
1. Parent node
2. Root node
3. Leaf node
4. Siblings
c
Explanation:

Question No: 2 of 12
`A binary tree in which all the leaves are on the same level is called as: `
Options:
1. Complete binary tree
2. Full binary tree
3. Strictly binary tree
4. Binary Search Tree
b
Explanation:

Question No: 3 of 12
`How can the graphs be represented? `
Options:
3. Incidence matrix
4. All of above
c
Explanation:

Question No: 4 of 12
`The children of same parent node are called as: `
Options:
2. Non-leaf node
3. Siblings
4. Leaf node
c
Explanation:

Question No: 5 of 12
`The maximum number of nodes at any level is: `
Options:
1. N
2. 2n
3. N+1
4. 2n
b
Explanation:

Question No: 6 of 12
`A tree with n vertices, consist of ----------------- edges. `
Options:
1. N-1
2. N-2
3. N
4. Log n
a
Explanation:

Question No: 7 of 12
`Select the one true statement `
Options:
1. Every binary tree is either complete or full
2. Every complete binary tree is also a full binary tree
3. Every full binary tree is also a complete binary tree
4. No binary tree is both complete and full
d
Explanation:

Question No: 8 of 12
`Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T? `
Options:
1. 0
2. 3
3. 4
4. 5
b
Explanation:

Question No: 9 of 12
`Select the one FALSE statement about binary trees: `
Options:
1. Every binary tree has at least one node
2. Every non-empty tree has exactly one root node
3. Every node has at most two children
4. Every non-root node has exactly one parent
a
Explanation:

Question No: 10 of 12
`Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child’s value be stored? `
Options:
1. Data[i+1]
2. Data[i+2]
3. Data[2*i+1]
4. Data[2*i+2]
c
Explanation:

1