blob: 3fb8defe65241e9d488de78f8617c060c2db6140 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
// Fig. 17.19: fig17_19.cpp
// Tree class test program.
#include <iostream>
using std::cout;
using std::cin;
using std::fixed;
#include <iomanip>
using std::setprecision;
#include "tree.h" // Tree class definition
int main()
{
Tree< int > intTree; // create Tree of int values
int intValue;
cout << "Enter 10 integer values:\n";
for( int i = 0; i < 10; i++ ) {
cin >> intValue;
intTree.insertNode( intValue );
} // end for
cout << "\nPreorder traversal\n";
intTree.preOrderTraversal();
cout << "\nInorder traversal\n";
intTree.inOrderTraversal();
cout << "\nPostorder traversal\n";
intTree.postOrderTraversal();
Tree< double > doubleTree; // create Tree of double values
double doubleValue;
cout << fixed << setprecision( 1 )
<< "\n\n\nEnter 10 double values:\n";
for ( int j = 0; j < 10; j++ ) {
cin >> doubleValue;
doubleTree.insertNode( doubleValue );
} // end for
cout << "\nPreorder traversal\n";
doubleTree.preOrderTraversal();
cout << "\nInorder traversal\n";
doubleTree.inOrderTraversal();
cout << "\nPostorder traversal\n";
doubleTree.postOrderTraversal();
cout << endl;
return 0;
} // end main
/**************************************************************************
* (C) Copyright 1992-2003 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. *
*************************************************************************/
|