If a binary search tree becomes unbalanced after an element is added, it is sometimes possible to efficiently rebalance the tree by ___________________ .
a) using left and right rotations
b) selecting a leaf node to use as a new root
c) reconstructing the tree from scratch
d) all of the above
e) it is impossible to rebalance a tree efficiently
