Provide a pseudocode of the following sentences

Updating the Last Node The insertion node can be found by traversing a path of O(log n) nodes Go up until a left child or the root is reached If a left child is reached, go to the right child . Go down left'until a leaf is reached Similar algorithm for updating the last node after a removal Updating the Last Node The insertion node can be found by traversing a path of O(log n) nodes Go up until a left child or the root is reached If a left child is reached, go to the right child . Go down left'until a leaf is reached Similar algorithm for updating the last node after a removal