Complete trees in arrays

Questions 1 to 5 of 7

1. 1. In a complete tree stored in a 0-based array, which slots hold the two children of slot 5?

   slots 6 and 7slots 10 and 11slots 11 and 12slots 5 and 6
2. 2. A complete tree has 13 nodes. What is its height?

   2346
3. 3. Which statement about perfect trees is true?

   A tree with 4 nodes is perfect, because 4 is a power of 2A tree is perfect whenever it is completeA full tree with 9 nodes is always perfectA perfect tree of height h has 2^(h+1) - 1 nodes
4. 4. Which statements about these three shapes are true? Pick all that apply.

   Pick every answer that is true.

   Every perfect tree is also completeEvery complete tree is also fullEvery full tree is also completeEvery perfect tree is also fullA straight chain of three nodes is neither full nor complete
5. 5. For a 0-based complete array, which index formulas are correct? Pick all that apply.

   Pick every answer that is true.

   The left child of slot i is slot 2*iThe left child of slot i is slot 2*i+1The parent of slot i is slot i/2The right child of slot i is slot 2*i+2The parent of slot i is slot (i-1)/2, using integer division