public class binarytreenode { public binarytreenode left { get; set; } public binarytreenode right { get; set; } public int data { get; set; } public binarytreenode(int data) { this.data = data; } } public void insertintobst(binarytreenode root, int data) { binarytreenode _newnode = new binarytreenode(data); binarytreenode _current = root; binarytreenode _previous = _current; while (_current != null) { if (data _current.data) { _previous = _current; _current = _current.right; } } if (data < _previous.data) _previous.left = _newnode; else _previous.right = _newnode; }