binary-search-tree

Binary Search Tree

Example: On inserting 1,

1

On inserting 2:

1
2

On inserting 0:

1 /
0 2

After deleting 2:

1 / 0

On inserting 3:

1 /
0 3