1174 Data Structures and Collections Chapter 23 182 (Web site domain)
1174 Data Structures and Collections Chapter 23 182 // recursive method to perform postorder traversal 183 private void PostorderHelper( TreeNode node ) 184 { 185 if( node == null ) 186 return; 187 188 // traverse left subtree 189 PostorderHelper( node.LeftNode ); 190 191 // traverse right subtree 192 PostorderHelper( node.RightNode ); 193 194 // output node data 195 Console.Write( node.Data + ” ” ); 196 } 197 198 } // end class Tree 199 } Fig. 23.17 Fig. 23.1FiFig. 23.17g. 23.17 Fig. 23.17 Definitions of TreeNodeand Treefor a binary search tree. (Part 5 of 5.) 1 // Fig. 23.18: TreeTest.cs 2 // This program tests class Tree. 3 4 using System; 5 using BinaryTreeLibrary; 6 7 namespace TreeTest 8 { 9 // class TreeTest definition 10 public class TreeTest 11 { 12 // test class Tree 13 static void Main( string[] args ) 14 { 15 Tree tree = new Tree(); 16 int insertValue; 17 18 Console.WriteLine( “Inserting values: ” ); 19 Random random = new Random(); 20 21 // insert 10 random integers from 0-99 in tree 22 for ( int i = 1; i <= 10; i++ ) 23 { 24 insertValue = random.Next( 100 ); 25 Console.Write( insertValue + " " ); 26 27 tree.InsertNode( insertValue ); 28 } 29 30 // perform preorder traversal of tree 31 Console.WriteLine( "nnPreorder traversal" ); Fig. 23.18 Fig. 23.1FiFig. 23.18g. 23.18 Fig. 23.18 Creating and traversing a binary tree. (Part 1 of 2.)
Note: In case you are looking for affordable and reliable webhost to host and run your j2ee application check Vision web and email hosting services