As i am understanding, if you delete the root node of a binary tree, there are two ways to re-order/re-connect the data. Left promotion and Right promotion.
Could someone check to see if this is correct.
Here is how i'm thinking it works.Code:10 / \ 6 14 / \ / \ 5 8 11 18
If i delete the root 10, and use left promotion...
the right subtree would move under 8 to the right?
and if it is right promotion and i delete 10 it moves the left subtree under the 11Code:6 / \ 5 8 \ 14 / \ 11 18
and would be:
is this correct?Code:14 / \ 11 18 / 6 / \ 5 8