public bool search(int value) { NodeTree current = head; while (current != null) { if (current.data == value) { return(true); } else if (current.data > value) { current = current.left; } else { current = current.right; } } return(false); }
public void add(int value) { if (head == null) { head = new NodeTree(value);; } else { NodeTree current = head; while (current != null) { if (current.data < value) { if (current.right == null) { current.right = new NodeTree(value); break; } else { current = current.right; } } else { if (current.left == null) { current.left = new NodeTree(value); break; } else { current = current.left; } } } } }