private void RandomButton__Click(object sender, EventArgs e) { // load a tree with random numbers BTree root = null; BTree node; Random random = new Random(); this.richTextBox.Clear(); for (int i = 0; i < 10; ++i) { node = new BTree(random.Next(100), root); if (i == 0) { root = node; } } this.richTextBox.Text += "\nAscending order:"; BTree.TraverseAscending(root); this.richTextBox.Text += "\nDescending order:"; BTree.TraverseDescending(root); VisualizeBinaryTree visualizeBinaryTree = new VisualizeBinaryTree(root); }
private void Button3_Click(object sender, EventArgs e) { // Prime a tree to hold alphabetical information this.richTextBox1.Clear(); BTree node = null; BTree root = null; node = new BTree("M", null); root = node; node = new BTree("F", root, false); node = new BTree("C", root, false); node = new BTree("B", root, false); node = new BTree("A", root, false); node = new BTree("E", root, false); node = new BTree("D", root, false); node = new BTree("J", root, false); node = new BTree("I", root, false); node = new BTree("H", root, false); node = new BTree("G", root, false); node = new BTree("L", root, false); node = new BTree("K", root, false); node = new BTree("P", root, false); node = new BTree("O", root, false); node = new BTree("N", root, false); node = new BTree("T", root, false); node = new BTree("S", root, false); node = new BTree("R", root, false); node = new BTree("Q", root, false); node = new BTree("W", root, false); node = new BTree("V", root, false); node = new BTree("U", root, false); node = new BTree("X", root, false); node = new BTree("Y", root, false); node = new BTree("Z", root, false); this.richTextBox1.Text += "\n"; BTree.TraverseAscending(root); this.richTextBox1.Text += "\n"; BTree.TraverseDescending(root); VisualizeBinaryTree visualizeBinaryTree = new VisualizeBinaryTree(root); }
private void Exercise4__Click(object sender, EventArgs e) { // Exercise #4 // prime the tree using the code in Button3_Click() // then insert the 15 random uppercase strings from Exercise #3 this.richTextBox.Clear(); BTree node = null; BTree root = null; // Your code here //code from button 3 node = new BTree("M", null); root = node; Random random = new Random(); node = new BTree("F", root); node = new BTree("C", root); node = new BTree("B", root); node = new BTree("A", root); node = new BTree("E", root); node = new BTree("D", root); node = new BTree("J", root); node = new BTree("I", root); node = new BTree("H", root); node = new BTree("G", root); node = new BTree("L", root); node = new BTree("K", root); node = new BTree("P", root); node = new BTree("O", root); node = new BTree("N", root); node = new BTree("T", root); node = new BTree("S", root); node = new BTree("R", root); node = new BTree("Q", root); node = new BTree("W", root); node = new BTree("V", root); node = new BTree("U", root); node = new BTree("X", root); node = new BTree("Y", root); node = new BTree("Z", root); //insert 15 random strings node = new BTree("Hi", root); node = new BTree("Cake", root); node = new BTree("My name is Victoria", root); node = new BTree("Spongebob squarepants", root); node = new BTree("pinapple", root); node = new BTree("Victoria", root); node = new BTree("Umbrella", root); node = new BTree("Cats are cool", root); node = new BTree("yellow", root); node = new BTree("Zebras have stripes", root); node = new BTree("I need coffee", root); node = new BTree("Suit and tie", root); node = new BTree("Rainbow", root); node = new BTree("Yo-yo", root); node = new BTree("Roots of a tree", root); //insert 30 numbers b/w 1 and 51 for (int i = 0; i < 30; i++) { //numbers between 1 and 51 node = new BTree(random.Next(1, 51), root); } this.richTextBox.Text += "\n"; BTree.TraverseAscending(root); this.richTextBox.Text += "\n"; BTree.TraverseDescending(root); VisualizeBinaryTree visualizeBinaryTree = new VisualizeBinaryTree(root); }