/*
* Inserts a new node into the tree.
*/
public void insertNode(int key, double value) {
/*
* Create a new node
*/
Nodes newNode = new Nodes(key, value);
if (root == null) {
root = newNode;
} else {
Nodes current = root;
Nodes parent = null;
while (current != null) {
if (key < current.iData) {
parent = current;
current = current.leftChild;
} else {
parent = current;
current = current.rightChild;
}
}
if (key < parent.iData) parent.leftChild = newNode;
else parent.rightChild = newNode;
}
}
