Complete trees in arrays

Questions 1 to 5 of 7

1. 1. A complete tree has 12 nodes and is stored in an array of 12 positions. Which index is the first leaf?

   56711
2. 2. What does this print? ``python def height_of_complete(n): return n.bit_length() - 1 print(height_of_complete(64)) ``

   53267
3. 3. A completeness check walks the tree one level at a time. It adds None to the queue for each missing child, so that it can see the gap. Which statement is true in Python?

   collections.deque accepts None as an item, so the check works as written.collections.deque raises TypeError when it gets None, so the check must skip the gaps.A list is the only container that can hold None.None cannot be stored in any queue, so a missing child must be left out.
4. 4. Which arrays does is_complete_array return True for? ``python def is_complete_array(arr): seen_none = False for item in arr: if item is None: seen_none = True elif seen_none: return False return True ``

   Pick every answer that is true.

   [1, 2, 3, None, None][1, None, 2][1, 2, None, 3][9]
5. 5. Which statements about full, complete and perfect trees are true?

   Pick every answer that is true.

   A perfect tree of height 2 has 7 nodesA complete tree with 6 nodes can be perfectEvery perfect tree is also full and completeA full tree with 7 nodes is always perfect