A left or right rotation is performed somewhere in a binary search tree.
Which of the following is guaranteed to stay the same?

Question

A left or right rotation is performed somewhere in a binary search tree. Which of the following is guaranteed to stay the same?

Answer

The key at the root of the whole tree

Answer

The order of the keys in an in-order traversal

Answer

The order of the keys in a level-order (breadth-first) traversal

Answer

The height of every node

Crowdly