Preorder traversal through Morse code BST
问题 In c++ I am working on two trees, 1 is alphabetical a-z with nums and characters 0-9 , . ? The other tree is the equivalent of those characters in Morse code. I have to have the different trees in text files that should already be in the correct order for insert. In my normal alphabet, I worked out my balanced text file for preorder traversal looks like P H D B A C F E G L J I K N M O 2 X T R Q S V U W 0 Y Z 1 9 5 4 3 7 6 8 , . ? This text file prints out preorder traversal , . 0 1 2 3 4 5 6