public BinarySearchTree(string val) { Debug.Assert(val != ""); Val = val; var ss = val.Split(); var FNode = new CountString(ss[0]); First = new TreeNode <CountString>(FNode); for (int i = 1; i < ss.Length; ++i) { this.AddWord(ss[i], First); } }
public int CompareTo(CountString countString) { return(String.CompareTo(countString)); }