Question discussion

In an AVL tree, a node has balance factor +2 (left-heavy) after an insertion, and its left child also has balance factor +1 (also left-heav…

564Medium DSSSB TGT Computer Science 0 replies 1 views
0
In an AVL tree, a node has balance factor +2 (left-heavy) after an insertion, and its left child also has balance factor +1 (also left-heavy). Which rotation restores balance?
  • ASingle Left rotation
  • BSingle Right rotation
  • CLeft-Right rotation
  • DRight-Left rotation
Correct answer: B

Discussion 0

Nobody has replied yet. Start the discussion!