import java.util.Scanner;

public class LevelOrderTest {

    public static void main(String[] args) {
        BST<String,String> bst = new BST<String,String>();
       
        System.out.println("Enter a sequence of letters (all uppercase) to be inserted into a binary search tree:");
        Scanner scanner = new Scanner(System.in);
        
        String s = scanner.nextLine();  
        // you might try "FGCEHBDA" to start, its level order is "FCGBEHAD"
        
        for (int i = 0; i < s.length(); i++) {
            bst.put(""+s.charAt(i), "");
        }
        
        Iterable<String> keys = bst.keysLevelOrder();
        System.out.print("Level Order = ");
        for (String key : keys) {
            System.out.print(key);
        }
    }
}