private void Button8_Click(object sender, EventArgs e)
{
// Exercise #5
// use the code in Button3_Click to add the 26 letters to the tree
// then remove nodes "C", "I" and "A"
// using this code to remove each node:
// // create new freestanding node for "C"
// nodeToDelete = new BTree("C", null);
// BTree.DeleteNode(nodeToDelete, root);
// add the newline and call BTree.TraverseAscending() after each delete
this.richTextBox1.Clear();
BTree node = null;
BTree nodeToDelete = null;
BTree root = null;
Button3_Click(sender, e);
nodeToDelete = new BTree("C", null);
BTree.DeleteNode(nodeToDelete, root);
BTree.TraverseAscending(node);
nodeToDelete = new BTree("I", null);
BTree.DeleteNode(nodeToDelete, root);
BTree.TraverseAscending(node);
nodeToDelete = new BTree("A", null);
BTree.DeleteNode(nodeToDelete, root);
BTree.TraverseAscending(node);
this.richTextBox1.Text += "\n";
BTree.TraverseAscending(root);
VisualizeBinaryTree visualizeBinaryTree = new VisualizeBinaryTree(root);
}
private void Exercise5__Click(object sender, EventArgs e)
{
// Exercise #5
// use the code in Button3_Click to add the 26 letters to the tree
// then remove nodes "C", "I" and "A"
// using this code to remove each node:
// // create new freestanding node for "C"
// nodeToDelete = new BTree("C", null);
// BTree.DeleteNode(nodeToDelete, root);
// add the newline and call BTree.TraverseAscending() after each delete
this.richTextBox.Clear();
BTree node = null;
BTree nodeToDelete = null;
BTree root = null;
// Your code here
//add 26 letters to tree
node = new BTree("M", null);
root = node;
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);
//remove C, I, and A
nodeToDelete = new BTree("C", null);
BTree.DeleteNode(nodeToDelete, root);
//new line and traverse ascending
this.richTextBox.Text += "\n";
BTree.TraverseAscending(root);
//delete i
nodeToDelete = new BTree("I", null);
BTree.DeleteNode(nodeToDelete, root);
//new line and traverse ascending
this.richTextBox.Text += "\n";
BTree.TraverseAscending(root);
//delete a
nodeToDelete = new BTree("A", null);
BTree.DeleteNode(nodeToDelete, root);
//new line and traverse ascending
this.richTextBox.Text += "\n";
BTree.TraverseAscending(root);
this.richTextBox.Text += "\n";
BTree.TraverseAscending(root);
VisualizeBinaryTree visualizeBinaryTree = new VisualizeBinaryTree(root);
}
