Crowdly

O(1), when the element is the root.

What is the worst-case time complexity for searching for an element in a Binary Search Tree with 'n' nodes, and under what condition does it occur?

O(n log n), when the tree is a complete tree.

O(log n), when the tree is balanced.

O(n), when the tree is skewed.

Is it possible to construct a unique Binary Search Tree (BST) using only its pre-order traversal sequence?

No, because you cannot determine the root of the right subtree.

Yes, this is always possible due to the inherent ordering property of a BST.

Yes, but only if the tree is also a complete binary tree.

No, an in-order traversal is always required to construct any unique binary tree.

What are the worst-case time complexities for a search operation in a standard Binary Search Tree (BST) and a self-balancing AVL tree, respectively, where 'n' is the number of nodes?

BST: O(n), AVL: O(log n)

BST: O(n), AVL: O(n)

BST: O(log n), AVL: O(n)

BST: O(log n), AVL: O(log n)

In an AVL tree, if an insertion causes a "Right-Left" (RL) imbalance at a particular node, how many rotations are required to restore the balance?

It depends on the height of the tree.

Two rotations (a double rotation).

One single rotation.

None, an RL imbalance does not require rotation.

Which of the following insertion sequences will produce a Binary Search Tree with the minimum possible height?

A Binary Search Tree is constructed by inserting the following sequence of numbers: {50, 25, 75, 15, 35, 65, 85}. What is the preorder traversal of the resulting BST?

65, 25, 75, 15, 35, 85, 50

50, 25, 15, 35, 75, 65, 85

15, 25, 35, 50, 65, 75, 85

15, 35, 25, 65, 85, 75, 50

If a Binary Search Tree is created by inserting elements that are already sorted in descending order, what will the resulting tree structure look like?

Which of the following is FALSE about friend functions?

They can access private and protected members

They are declared inside class but defined outside

They are not members of the class

They can be called using an object like obj.friendFunc()

Analyze this destructor implementation:


Person::~Person() {
    if(childrenList != nullptr) {
        delete childrenList;  // Note: delete, not delete[]
    }
}
What is the primary issue with this code?

Using `delete` instead of `delete[ ]` for an array causes undefined behavior

The destructor should also set `childrenList` to `nullptr`

The destructor should delete `name` as well

The null pointer check is unnecessary