The time complexity of the find operation, in an AVL tree with n nodes, is: Select one: a. O(log n) b. O(n) c. O(1) Drag and drop the correct words into the boxes of the following statement: Given a binary search tree T, an internal node v of T is if the absolute value of the difference between the heights of the children of v is at most one; otherwise, it is Rebalancing an AVL tree after adding or removing a node is called Select one: a. insertAtExternal b. Unbalancing c. Trinode restructuring