nstatic tree::node*
add(tree::node* node_ptr,
n tree::node* new_node)
{
n if (node_ptr) {
n if(new_node->emp.get_salary() <
n node_ptr->emp.get_salary() )
n node_ptr->left =
add(node_ptr->left, new_node);
n else
n node_ptr->right =
add(node_ptr->right, new_node);
n return (node_ptr);
n } else
n return (new_node);
n}
nvoid
tree::insert(const employee &emp) { //insert employee
n node* new_node = new node(emp);
n root = add(root, new_node);
n}
n
n