public void Insert(int data) { Queue <NodeN> q = new Queue <NodeN>(); if (this.Root == null) { this.Root = new NodeN(data); return; } q.Enqueue(this.Root); while (q.Count() != 0) { NodeN n = q.Dequeue(); if (n.Left == null) { n.Left = new NodeN(data); q.Clear(); break; } else if (n.Right == null) { n.Right = new NodeN(data); q.Clear(); break; } else { q.Enqueue(n.Left); q.Enqueue(n.Right); } } }
public void ClearAll() { this.Root = null; }
public NonBSTN() { this.Root = null; }