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); }
static void Main(string[] args) { BinarySearchTree bst = new BinarySearchTree(); bst.AddNode(15); bst.AddNode(10); bst.AddNode(7); bst.AddNode(50); bst.AddNode(12); bst.AddNode(11); bst.AddNode(45); bst.AddNode(13); bst.AddNode(55); bst.AddNode(14); if (bst.Search(12)) { Console.WriteLine("Found"); } else { Console.WriteLine("Not found"); } if (bst.Search(60)) { Console.WriteLine("Found"); } else { Console.WriteLine("Not found"); } bst.Inorder(); bst.Preorder(); bst.Postorder(); int size = bst.Size(); Console.WriteLine($"The number of nodes in the tree :{size}"); if (bst.Search(10)) { bst.DeleteNode(10); } else { Console.WriteLine("Item is not in the tree"); } bst.Preorder(); size = bst.Size(); Console.WriteLine($"The number of nodes in the tree :{size}"); bst.MakeEmpty(); bst.Preorder(); size = bst.Size(); Console.WriteLine($"The number of nodes in the tree :{size}"); Console.Read(); }
static void Main(string[] args) { BinarySearchTree <int> binarySearchTree = new BinarySearchTree <int>() { 10, 8, 7, 9, 11, 12, 6 }; binarySearchTree.Add(10); binarySearchTree.Add(8); binarySearchTree.Add(7); binarySearchTree.Add(9); binarySearchTree.Add(11); binarySearchTree.Add(12); binarySearchTree.Add(6); List <string> result = binarySearchTree.Search(9); //BinarySearchTree<string> binarySearchTree = new BinarySearchTree<string>() { "hi", "world", "i", "am", "testing", "this" }; foreach (var item in binarySearchTree) { Console.WriteLine(item); } foreach (var item in result) { Console.WriteLine(item); } Console.ReadLine(); }
static void Main(string[] args) { BinarySearchTree tree = new BinarySearchTree(); tree.Add(6); tree.Add(5); tree.Add(10); tree.Add(9); tree.Search(9); }
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) { BinarySearchTree sandbox = new BinarySearchTree(); sandbox.Add(12); sandbox.Search(12, sandbox.root); if (sandbox.Search(12, sandbox.root) == true) { Console.WriteLine("true"); } else { Console.WriteLine("false"); } sandbox.Add(14); sandbox.Add(16); sandbox.Add(8); sandbox.Search(8, sandbox.root); if (sandbox.Search(8, sandbox.root) == true) { Console.WriteLine("true"); } else { Console.WriteLine("false"); } sandbox.Add(24); sandbox.Add(2); if (sandbox.Search(64, sandbox.root) == true) { Console.WriteLine("true"); } else { Console.WriteLine("false"); } Console.ReadLine(); }