Write a method called makePerfect that adds nodes until the

binary tree is a perfect tree. A perfect binary tree is one where

all leaves are at the same level. Another way of thinking of it

is that you are adding dummy nodes to the tree until every

path from the root to a leaf is the same length. A perfect tree$$s

shape is exactly triangular and every branch node has exactly

two children, and all of the leaves are at the same level. Each

new node you add to the tree should store the value $0.$ For

example, if a variable t refers to reference tree #$2,$ then the

call t$.$makePerfect$()$; should change the tree$$s state to the