This time the assessment 4.
The question request to write a phone book program to store user contact name, number, email and address. Everything must done by using binary tree.
very headache to think of this complicated recursive thing. Because the easiest way of doing binary tree is doing a recursive function to travel along your node.
without recursive, you very hard to travel back to your previous node.
But those value return by the recursive function is the most headache to me, i not sure what will they return in the end.