Complete Binary Trees

Question 1

complete binary tree

Answer 1

all levels are completely filled in except for the last level which is filled from left to right

Question 2

complete binary tree in array form. how do you find the parent node?

Answer 2

integer result of the array index / 2. if node is position 2, parent node is 1. if node is position 3, parent node is 1.

Question 3

complete binary tree in array form. left child node?

Answer 3

array index * 2

Question 4

complete binary tree in array form. right child node?

Answer 4

array index * 2 plus 1.

Question 5

complete binary tree in array form. how do you find leaf nodes?

Answer 5

if n is size of array, any index > n / 2 (integer result) is a leaf node

Question 6

complete binary tree in array form. what’s at the 0th index of the array?

Answer 6

empty (or number of nodes)