Question

6. T or F: There can be two or more nodes in a heap with exactly one child.
7. T or F: A heap can have no nodes with exactly one child.
8. T or F: All heaps are perfect trees.
9. T or F: No heaps are perfect trees.
10. T or F: All heaps are complete trees.
11. T or F: No heaps are complete trees.
12. T or F: A binary tree with one node must be a heap.
13. T or F: A binary tree with two nodes and with the root having the smallest value must be a min-heap.
14. T or F: If a node in a heap is a right child and has two children, then its sibling must also have two children.
15. T or F: If a node in a heap is a right child and has one child, then its sibling must also have one child.

Answer 1

6.False(a heap can have only one node with one child )

7.False(the heap can have one node with one child)

8.false ( all the heap with child node at equal level are perfect tree)

9.False(heap with leaf node at same depth is perfect tree)

10.False(heap without a node having single child is complete tree)

11.false(a heap where all the node has two children then it is complete tree)

12.True

13.True

14.True (because heap is a binary tree with heap property)

15.False (then the sibling in left side must be having two child)