BST , AVL Tree & B-tree

What are the key properties of a B tree?

• A B tree allows only for efficient search operations, not insertion or deletion.

• A B tree is a balanced tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations.

• A B tree is an unbalanced tree structure that can lead to inefficient operations.

• A B tree is a linear data structure that does not maintain sorted data.

How do you perform an insertion operation in a binary search tree?

• Insert the value in the correct position based on comparisons.

• Always insert values to the left regardless of comparisons.

• Insert the value at the root of the tree.

• Delete the smallest value before inserting the new value.

What is the purpose of rotations in AVL trees?

• To convert the tree into a binary search tree.

• To store additional data in the nodes of the tree.

• To maintain the balance of the tree after insertions or deletions.

• To increase the height of the tree after insertions.

Compare the advantages of B trees and AVL trees.

• B-trees are better for disk-based storage; AVL trees are better for in-memory access.

• B-trees are faster for in-memory access; AVL trees are slower for disk-based storage.

• B-trees are simpler to implement than AVL trees.

• AVL trees require more memory than B-trees for large datasets.

Explain the concept of height balancing in AVL trees.

• Height balancing in AVL trees is only necessary for the root node.

• Height balancing in AVL trees allows for any subtree height difference.

• AVL trees do not require balancing after insertions or deletions.

• Height balancing in AVL trees ensures that the heights of the left and right subtrees of any node differ by at most one.

How do you search for a value in a binary search tree?

• Traverse the tree, comparing values and moving left or right based on comparisons.

• Only check the root node for the value.

• Use a linear search through all nodes in the tree.

• Search the tree by randomly selecting nodes.

What is the maximum number of children a B tree node can have?

• 2m

• m

• m+1

• m-1

Describe the process of deleting a node from a binary search tree.

• Delete a node by locating it, handling three cases: leaf, one child, or two children.

• Delete a node by simply removing it without checking its children.

• Only delete nodes that have two children in a binary search tree.

• Always replace the node with its parent node during deletion.

What are the different types of rotations in AVL trees?

• Left Rotation, Right Rotation, Left-Right Rotation, Right-Left Rotation

• Single Rotation

• Circular Rotation

• Triple Rotation

How does the height of a B tree compare to that of a binary search tree?

• The height of a B-tree can be higher than that of a binary search tree in all cases.

• B-trees have the same height as binary search trees.

• The height of a B-tree is generally lower than that of a binary search tree.

• The height of a B-tree is always greater than that of a binary search tree.