In a weight-balanced tree, a new node with a large weight is inserted as the right child of a node with a small weight.How might the tree adapt to maintain balance, and what rotation operation is likely to be involved?a)No action is needed.b)The left subtree's weight increases; left rotation is performed.c)The right subtree's weight increases; right rotation is performed.d)The left subtree's weight decreases; double rotation is performed.

During an insertion operation in a weight-balanced tree, if the weight balance factor of a node violates the criterion, what type of rotation might be performed?a)Single rotationb)Quadruple rotationc)Double rotationd)Triple rotation

Which operation is not a valid balancing operation in a height-balanced tree?a)Right rotationb)Left rotationc)Swap operationd)Left-right rotation (LR Rotation)

What is the primary criterion for balancing in a Height Balanced Tree?a)The weight on the edges of the treeb)The difference in height between left and right subtreesc)The total number of nodes in the treed)The weight of the subtrees

If, during a deletion operation in a weight-balanced tree, the weight balance factor of a node violates the criterion, a _____ rotation might be performed to restore balance.a)singleb)quadruplec)doubled)triple

In a weight-balanced tree, the _____ of a node is defined as the number of nodes in its left subtree divided by the number of nodes in its right subtree.