Which XXX completes the C++ AVLTree class's Insert() function? void Insert(Node* node) { if (!root) { root = node; } else { Node* currentNode = root; while (currentNode) { if (node->key < currentNode->key) { if (currentNode->left == nullptr) { currentNode->left = node; node->parent = currentNode; currentNode = nullptr; } else { currentNode = currentNode->left; } } else { if (currentNode->right == nullptr) { currentNode->right = node; node->parent = currentNode; currentNode = nullptr; } else { currentNode = currentNode->right; } } } XXX while (node) { Rebalance(node); node = node->parent; } } } 单项选择题
登录即可查看完整答案
我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

Question

Which XXX completes the C++ AVLTree class's Insert() function?

void Insert(Node* node) {
   if (!root) {
      root = node;
   }
   else {
      Node* currentNode = root;
      while (currentNode) {
         if (node->key < currentNode->key) {
            if (currentNode->left == nullptr) {
               currentNode->left = node;
               node->parent = currentNode;
               currentNode = nullptr;
            }
            else {
               currentNode = currentNode->left;
            }
         }
         else {
            if (currentNode->right == nullptr) {
               currentNode->right = node;
               node->parent = currentNode;
               currentNode = nullptr;
            }
            else {
               currentNode = currentNode->right;
            }
         }
      }
      XXX
      while (node) {
         Rebalance(node);
         node = node->parent;
      }
   }
}

BlackTom AI · Accepted Answer

The question asks what should fill the XXX in the AVLTree Insert function after linking the new node into the tree.
First, note what the code does: it inserts the new node as a leaf, setting its parent appropriately, and then reaches the XXX placeholder. After insertion, rebalancing must propagate from the newly inserted node up toward the root, since AVL trees require balancing based on the ancestors of the inserted node.
Option assessment (only one option is provided):
- node = node->parent; This choice moves the current focus from the newly inserted node to its parent. Since the subsequent loop is while (node) { Rebalance(node); node = node->parent; }, setting node to its parent ensures that Rebalance is called for the parent, then its grandparent, and so on up to the root. This is exactly the intended behavior for updating balance factors and performing rotations as needed for AVL properties.
Why this is correct conceptually: after inserting a new node, the primary balance violations (if any) can only occur on the path from the new node up to the root. Starting the rebalance sequence at the parent avoids rebalancing the newly inserted leaf (which has no imbalance), and aligns with the standard approach of updating ancestors.
Why other possibilities (if any) would be incorrect: since only one option is presented, we can reason about what would happen if a different action were taken (e.g., continuing with node unchanged). Keeping node as the newly inserted node would attempt to rebalance from the leaf itself, which is unnecessary and could disrupt the intended parent-to-root rebalancing flow. It would also fail to correctly traverse up to higher ancestors unless additional logic were added elsewhere. In general, after insertion, the balancing logic should ascend from the parent of the inserted node, not from the inserted node itself.
In summary, setting node to its parent before entering the rebalance loop correctly initiates upward rebalancing along the path from the insertion point to the root, aligning with AVL-tree balancing mechanics.

类似问题

Which XXX would replace the missing statement in the algorithm for inserting a new node in an empty AVL tree? AVLTreeInsert(tree, node) { XXX { tree⇢root = node node⇢parent = null return } ... }

What is the worst-case performance of the insert method in an AVL tree with linked nodes?

In which security measure will you find anti-virus software?

What are user permissions?

Which security measure will stop someone reading your messages if they find your smart phone?

On a network a firewall

What is the name for emails that are sent to users, pretending to be from their bank and asking for username and password?

To stop users of a network from playing games all day instead of working, which would be the best security measure to use?

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单