{"@context":"https://schema.org/","@type":"Quiz","dateCreated":"2026-07-04T12:51:40.108Z","dateModified":"2026-07-04T12:51:40.108Z","typicalAgeRange":"11-18","educationalLevel":"AP PGECET","assesses":"Computer Science and IT Engineering - OOPs concept","educationalAlignment":[{"@type":"AlignmentObject","alignmentType":"educationalTopic","targetName":"OOPs concept"},{"@type":"AlignmentObject","alignmentType":"educationalSubject","targetName":"Computer Science and IT Engineering"},{"@type":"AlignmentObject","alignmentType":"educationalExam","targetName":"AP PGECET"}],"name":"Quiz about OOPs concept","about":{"@type":"Thing","name":"Computer Science and IT Engineering - OOPs concept"},"hasPart":[{"@type":"Question","eduQuestionType":"Multiple choice","learningResourceType":"Practice problem","educationalLevel":"intermediate","name":"Question About OOPs concept","text":"What is the primary difference between a B-tree and a B+ tree?}","encodingFormat":"text/markdown","comment":{"@type":"Comment","text":"Most modern relational databases (like MySQL and PostgreSQL) use B+ trees specifically because of the linked leaf nodes and the efficiency of range-based searches."},"suggestedAnswer":[{"@type":"Answer","position":0,"encodingFormat":"text/markdown","text":"

B-trees have a higher fill factor.

","comment":{"@type":"Comment","text":"\"\""}},{"@type":"Answer","position":1,"encodingFormat":"text/markdown","text":"

B+ trees store data pointers only in the leaf nodes.

","comment":{"@type":"Comment","text":"\"\""}},{"@type":"Answer","position":2,"encodingFormat":"text/markdown","text":"

B-trees do not allow duplicate keys.

","comment":{"@type":"Comment","text":"\"\""}},{"@type":"Answer","position":3,"encodingFormat":"text/markdown","text":"

B+ trees cannot be used for primary indexing.\n\n\n

","comment":{"@type":"Comment","text":"\"\""}}],"acceptedAnswer":{"@type":"Answer","position":1,"encodingFormat":"text/markdown","text":"

B+ trees store data pointers only in the leaf nodes.

","comment":{"@type":"Comment","text":"Most modern relational databases (like MySQL and PostgreSQL) use B+ trees specifically because of the linked leaf nodes and the efficiency of range-based searches."},"answerExplanation":{"@type":"comment","text":""}}}]}

What is the primary difference between a B-tree and a B+ tree?

Show Hint

The Correct Option is B

Solution and Explanation

Top Questions on OOPs concept

Questions Asked in AP PGECET exam