QWhat is a B-tree?

Choose the Best Option

Click any option to instantly check if you're correct.

• A A binary search tree that can have more than two children per node ✔ ✖
• B A binary tree in which every node has exactly two children ✔ ✖
• C A self-balancing binary search tree that maintains a height difference of at most 1 between subtrees ✔ ✖
• D A binary search tree that does not allow duplicates ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions