static void Main() { set = new RankedSet <int>() { Capacity = 4 }; Console.WriteLine("Create sequentially loaded tree of order 4:"); for (int i = 2; i <= 44; i += 2) { set.Add(i); } WriteInfo(); Console.WriteLine("Add 1,21:"); set.Add(1); set.Add(21); WriteInfo(); Console.WriteLine("Add 9:"); set.Add(9); WriteInfo(); Console.WriteLine("Add 27:"); set.Add(27); WriteInfo(); Console.WriteLine("Remove 44:"); set.Remove(44); WriteInfo(); Console.WriteLine("Remove 40,42:"); set.Remove(40); set.Remove(42); WriteInfo(); Console.WriteLine("Remove 38:"); set.Remove(38); WriteInfo(); Console.WriteLine("Remove 34,36:"); set.Remove(34); set.Remove(36); WriteInfo(); Console.WriteLine("Remove 32:"); set.Remove(32); WriteInfo(); Console.WriteLine("Remove 28:"); set.Remove(28); WriteInfo(); Console.WriteLine("Seek 30:"); var isOk = set.Contains(30); Console.WriteLine(); Console.WriteLine("Result = " + isOk); Console.WriteLine(); Console.WriteLine("Remove 30:"); set.Remove(30); WriteInfo(); }