Advertisement
Guest User

Untitled

a guest
Apr 16th, 2014
57
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.85 KB | None | 0 0
  1. private HuffmanTree<Character> restore(HuffmanTree<Character> root, Scanner infile)
  2.     {
  3.         while (infile.hasNextLine())
  4.         {
  5.             String line = infile.nextLine();        //Maybe put these two lines in another private method?
  6.             Character[] toBeAdded = huffFileToCharacterArray(line);
  7.             System.out.println("Character[1]: " + toBeAdded[1]);
  8.  
  9.             if (toBeAdded[0].equals('I'))       //In this case, the root has two child nodes
  10.             {
  11.                 root.left = new HuffmanTree<Character>('\0');
  12.                 root.right = new HuffmanTree<Character>('\0');
  13.  
  14.                 restore((HuffmanTree<Character>) root.left, infile);    //Read in the node's left and right subtrees
  15.                 restore((HuffmanTree<Character>) root.right, infile);
  16.             }
  17.             else    //i.e. toBeAdded[0].equals('L')
  18.             {
  19.                 HuffmanTree<Character> newNode = new HuffmanTree<Character>(toBeAdded[1]);
  20.                 root = newNode;
  21.             }
  22.         }
  23.         return root;
  24.     }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement