static void Main(string[] args) { BTree tree = new BTree(); Node node = new Node();; for (int i = 1; i < 10; i++) { node = tree.insert(node, i); } tree.inorder(node); Console.ReadLine(); }
static void Main(string[] args) { Random rand = new Random(10); BTree tree = new BTree(); List <int> values = new List <int>(Constants.MAX_SIZE); for (int i = 0; i < values.Capacity; i++) { var nextRand = 0; nextRand = rand.Next(10); if (!(values.Contains(nextRand))) { values.Insert(i, nextRand); } else { --i; } } foreach (int value in values) { tree.insert(value); } Console.Write("Inorder traversal: "); tree.inorder(ref tree.root, tree.display); Console.Write("\n"); Console.Write("Preorder traversal: "); tree.preorder(ref tree.root, tree.display); Console.Write("\n"); Console.Write("Postorder traversal: "); tree.postorder(ref tree.root, tree.display); Console.Write("\n"); Console.Read(); }
static void Main(string[] args) { BTree tree = new BTree(); Node node = new Node(); ; for (int i = 1; i < 10; i++) node = tree.insert(node, i); tree.inorder(node); Console.ReadLine(); }