private void btnAdd_Click(object sender, EventArgs e)
{
try
{
var val = int.Parse(inputTextBox.Text);
if (_tree == null)
{
btnCreate_Click(btnCreate, new EventArgs());
}
_tree.Insert(val);
PaintTree();
inputTextBox.SelectAll();
this.Update();
}
catch (Exception exp)
{
MessageBox.Show(exp.Message);
}
}
static void Main(string[] args)
{
BinarySearchTree bst = new BinarySearchTree();
int userInput = -1;
do
{
Console.Clear();
userInput = DisplayMenu();
Console.Clear();
switch (userInput)
{
case 1:
//bst.generateTree();
bst.Insert(getNumber("Enter number to be inserted: "));
continuation();
break;
case 2:
bst.Delete(getNumber("Enter number to be deleted: "));
continuation();
break;
case 3:
bst.Display();
continuation();
break;
default:
Console.WriteLine("Action unsucessful: Invalid code!");
break;
}
} while (userInput != 0);
}
public void Run()
{
//Node root = BuildTree();
BinarySearchTree bst = new BinarySearchTree();
int[] values = new int[] { 8, 10, 7, 16, 14, 11, 1, 3, 5, 13 };
Node root = null;
foreach (int v in values)
{
root = bst.Insert(root, v);
}
PrintTree(root, "Insert: ");
PrintNode(bst.Search(root, 8), "Search 8: ");
PrintNode(bst.Search(root, 9), "Search 9: ");
// PrintTree(bst.DeleteMin(root), "DeleteMin: ");
// PrintTree(bst.DeleteMax(root), "DeleteMax: ");
PrintTree(bst.Delete(root, 8), "Delete 8: ");
// PrintTree(bst.Delete(root, 12), "Delete 12: ");
}
static void Main(string[] args)
{
#region BST
//==========================
// BINARY SEARCH TREE
//==========================
BinarySearchTree <string> BST = new BinarySearchTree <string>();
BST.Insert(5, "Tony Stark");
BST.Insert(8, "Thor");
BST.Insert(1, "Hulk");
BST.Insert(9, "Black Panther");
BST.Insert(2, "Pokember");
BST.Insert(10, "Thanos");
Console.WriteLine("PREORDER\n", new string('-', 8));
BST.Admittance(AdmittanceType.PreOrder);
Console.WriteLine("INORDER\n", new string('-', 8));
BST.Admittance(AdmittanceType.InOrder);
Console.WriteLine("POSTORDER\n", new string('-', 8));
BST.Admittance(AdmittanceType.PostOrder);
#endregion
Console.WriteLine(new string('=', 20));
#region BSTG
//=================================
// BINARY SEARCH TREE GENERIC TYPE
//=================================
BinarySearchTree_GenKey <int, string> BSTG = new BinarySearchTree_GenKey <int, string>();
BSTG.Insert(50, "apple");
BSTG.Insert(60, "banana");
BSTG.Insert(70, "blackberry");
BSTG.Insert(40, "pineapple");
BSTG.Insert(10, "coconut");
BSTG.Insert(20, "pear");
Console.WriteLine("\nPREORDER\n", new string('-', 8));
BSTG.Admittance(AdmittanceType.PreOrder);
Console.WriteLine("\nINORDER\n", new string('-', 8));
BSTG.Admittance(AdmittanceType.InOrder);
Console.WriteLine("\nPOSTORDER\n", new string('-', 8));
BSTG.Admittance(AdmittanceType.PostOrder);
#endregion
Console.ReadLine();
}
static void Main(string[] args)
{
Console.WriteLine("Binary Tree Implimentation!");
BinarySearchTree <int> binarySearchTree = new BinarySearchTree <int>(56);
binarySearchTree.Insert(30);
binarySearchTree.Insert(70);
binarySearchTree.Insert(22);
binarySearchTree.Insert(40);
binarySearchTree.Insert(11);
binarySearchTree.Insert(3);
binarySearchTree.Insert(16);
binarySearchTree.Insert(60);
binarySearchTree.Insert(95);
binarySearchTree.Insert(65);
binarySearchTree.Insert(63);
binarySearchTree.Insert(67);
binarySearchTree.Display();
binarySearchTree.GetSize();
binarySearchTree.Search(11, binarySearchTree);
binarySearchTree.Search(75, binarySearchTree);
}
