fig20_11.pl

来自「PERL语言资料 可以用于PERL程序设计」· PL 代码 · 共 46 行

#/usr/bin/perl 
# Fig. 20.11: fig20_11.pl
# Using a binary search tree.

use warnings;
use strict;
use BinarySearchTree;

my $tree = new BinarySearchTree();

print( "The numbers being placed in the tree are:\n" );

for ( 1 .. 15 ) {
   my $data = int( rand( 15 ) );
   print( "$data " );
   $tree->insertNode( $data );
}

print( "\n\nThe tree looks like:\n" );
$tree->printTree();

print( "\nThe preOrder traversal is: \n" );
$tree->printPreOrder();

print( "\n\nThe inOrder traversal is: \n" );
$tree->printInOrder();

print( "\n\nThe postOrder traversal is: \n" );
$tree->printPostOrder();

###########################################################################
#  (C) Copyright 2001 by Deitel & Associates, Inc. and Prentice Hall.     #
#  All Rights Reserved.                                                   #
#                                                                         #
#  DISCLAIMER: The authors and publisher of this book have used their     #
#  best efforts in preparing the book. These efforts include the          #
#  development, research, and testing of the theories and programs        #
#  to determine their effectiveness. The authors and publisher make       #
#  no warranty of any kind, expressed or implied, with regard to these    #
#  programs or to the documentation contained in these books. The authors #
#  and publisher shall not be liable in any event for incidental or       #
#  consequential damages in connection with, or arising out of, the       #
#  furnishing, performance, or use of these programs.                     #
###########################################################################