4.1

4.1, without using a recursive way, not using the getHeight way but
searching the tree in an order of breadth_first, find the first leaf
node, then find if other node in the queue has a grandchild…. Oh my
god… it’s wrong, if the first leaf node is the rightmost one, and the
left side is unbalanced.