Which of these tree balancing algorithms is more efficient?

AVL tree or RB tree?

AVL CODE

RED BLACK CODE

RBTreeRotateLeft code

RBTreeRotateLeft(tree, node) {

rightLeftChild = node->right->left

if (node->parent != null)

RBTreeReplaceChild(node->parent, node, node->right)

else { // node is root

tree->root = node->right

tree->root->parent = null

}

RBTreeSetChild(node->right, "left", node)

RBTreeSetChild(node, "right", rightLeftChild)

}

RBTreeRotateRight code

RBTreeRotateRight(tree, node) {

leftRightChild = node->left->right

if (node->parent != null)

RBTreeReplaceChild(node->parent, node, node->left)

else { // node is root

tree->root = node->left

tree->root->parent = null

}

RBTreeSetChild(node->left, "right", node)

RBTreeSetChild(node, "left", leftRightChild)

}

Figure 5.2.1: AVLTreeUpdateHeight, AVLTreeSetChild, AVLTreeReplaceChild, and AVLTreeGetBalance algorithms. AVLTreeUpdateHeight (node) leftHeight--1 if (node->left 1- null) leftLeight = node->left->height rightHeight - -1 if (node->right !- null) rightHeight - node->right->height node->height - max(leftHeight, rightHeight) 1 AVLTreeSetChild (parent, whichChild, child) if (whichChild - "left"&& whichChild !-"right") return false if (whichChild"left") else if (child != null) parent->leftchild parent->right = child child->parent -parent AVLTreeUpdateHeight (parent) return true AVLTreeReplaceChild (parent, currentChild, newChild) ( if (parent->leftcurrentChild) else if (parent->right currentChild) return false return AVLTreeSetChild (parent, "left", newChild) return AVLTreeSetChild (parent, "right", newChild) AVLTreeGetBalance (node) leftHeight-1 if (node->left 1- null) leftHeight -node->left->height rightHeight - -1 if (node->right 1- null) rightHeight -node->right->height return leftHeight - rightHeight