Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.*;
- import java.util.*;
- public class BinaryTreeTraversal {
- /**
- * @param args
- */
- public static void main(String[] args) {
- Scanner input = new Scanner("input.txt");
- int n = input.nextInt();
- int m = (int) Math.pow(2,n)-1;
- List<BinaryNode<Character>> list = new ArrayList<BinaryNode<Character>>();
- for (Character c : input.nextLine().toCharArray()) {
- list.add(new BinaryNode<Character>(Character.isLetter(c) ? c : null));
- }
- BinaryNode<Character> root = list.get(0);
- // HERE: turn the flat, unrelated array of BinaryNode's into a real tree starting with root.
- System.out.println(root.toStringPreOrder());
- System.out.println(root.toStringInOrder());
- System.out.println(root.toStringPostOrder());
- // done!
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement