Subversion Repositories programming

Rev

Rev 46 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 46 Rev 50
Line 271... Line 271...
271 
        Queue queue = new Queue();
 271 
        Queue queue = new Queue();
272 
        queue.enqueue(tree);
 272 
        queue.enqueue(tree);
273 
 
 273 
 
274 
        while( !queue.isEmpty() ) {
 274 
        while( !queue.isEmpty() ) {
275 
            AVLTree temp = (AVLTree)queue.dequeue();
 275 
            AVLTree temp = (AVLTree)queue.dequeue();
276 
            System.out.print(temp.getKey());
 276 
            System.out.print(temp.getKey()+" ");
277 
            if( temp.getLeft() != NIL ) { queue.enqueue(temp.getLeft()); }
 277 
            if( temp.getLeft() != NIL ) { queue.enqueue(temp.getLeft()); }
278 
            if( temp.getRight() != NIL ) { queue.enqueue(temp.getRight()); }
 278 
            if( temp.getRight() != NIL ) { queue.enqueue(temp.getRight()); }
279 
        }
 279 
        }
280 
    }
 280 
    }
281 
 
 281 
 
282 
    //method to print a tree in PreOrder
 282 
    //method to print a tree in PreOrder
283 
    public static void printPreOrder( AVLTree tree ) {
 283 
    public static void printPreOrder( AVLTree tree ) {
284 
        if( tree == NIL ) return;
 284 
        if( tree == NIL ) return;
285
285
286 
        System.out.print(tree.getKey());
 286 
        System.out.print(tree.getKey()+" ");
287 
        AVLTree.printPreOrder( tree.getLeft() );
 287 
        AVLTree.printPreOrder( tree.getLeft() );
288 
        AVLTree.printPreOrder( tree.getRight() );
 288 
        AVLTree.printPreOrder( tree.getRight() );
289 
    }
 289 
    }
290 
 
 290 
 
291 
} //end AVLTree class
 291 
} //end AVLTree class