To compute the depth of a given node in an RBT in constant time, consider augmenting the depths of nodes as additional attributes in the nodes of the RBT. Please explain by an example why this augmentation increases the asymptotic time complexity of inserting a node into an RBT in the worst case.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here