Ok, this something which I can find on the web, but I'm kind of having trouble finding it. I'm learning about insertion in a binary search tree and rotation. This is where you have to rotate certain nodes in a tree to restore its shape after inserting a key into a tree.
Given 31,42,59,44, and 36, use root insertion to insert into an initially empty tree. How would this be done?
Given 50,34,56,78,98 (assuming this is traversing inorder), what would rootInsert(30) be?
