public bool search(data s) { return(root.search(root, s)); }
public Node(data value) { number = value; rightLeaf = null; leftLeaf = null; }
public bool search(data s) { return(root.search(root, s)); }
public Node(data value) { number = value; rightLeaf = null; leftLeaf = null; }