Write down a level order traversal that does every level of the binary tree before moving on to the next level. Starting with the root add the children nodes to list, add current data to the string and then process first item within the list in a recursive fashion.