In a perfectly balanced tree the insertion of a node needs-03460
In a perfectly balanced tree the insertion of a node needs __________.
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Final Term - Quiz No.16.
In a perfectly balanced tree the insertion of a node needs __________.
One rotation
Two rotations
Rotations equal to number of levels
No rotation at all
