All of .insert(), .search(), .delete(), .min() and .successor() run in O(h) steps for a BST of height h. It is possible to augment a BST so that .min() and .successor() (and likewise .max() and...

All of .insert(), .search(), .delete(), .min() and .successor() run in O(h) steps for a BST of height h. It is possible to augment a BST so that .min() and .successor() (and likewise .max() and .predecessor()) run in O(1) steps without compromising the O(h) running time of the other operations. Describe how you could do it.