Tree Insert
	• From last time... – everyone should have prepared an algorithm for insert – remember, insert always inserts data at a leaf – this is similar, in many regards to inserting data at the end of a linear linked list; the good news is that we don’t have to special case the situation where we are trying to rearrange pointers by inserting in the middle