Back to Insert

L

R

x

> x

< x

void insert(Node *& root, Object x) {

Node * left, * right;

split(root, left, right, x);

root = new Node(x, left, right);

}

Previous slide

Next slide

Back to first slide

View graphic version