ExamLookup
Menu mobile
Home
Current Affairs
General Knowledge
Computer
Python
HTML
GATE
: Computer Science and IT
B+ Trees are considered BALANCED because , B+ Trees are considered BALANCED because
B+ Trees are considered BALANCED because
A.
the lengths of the paths from the root to all leaf nodes are all equal.
the lengths of the paths from the root to all leaf nodes are all equal.
B.
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1
C.
the number of children of any two non-leaf sibling nodes differ by at most 1
the number of children of any two non-leaf sibling nodes differ by at most 1
D.
the difference between two leaf node is almost one
the difference between two leaf node is almost one
Solution
A. the lengths of the paths from the root to all leaf nodes are all equal.
Explanation
In both B Tree and B+ trees, depth (length of root to leaf paths) of all leaf nodes is same. This is made sure by the insertion and deletion operations.
CCC Online Test 2021
CCC Practice Test Hindi
Python Programming Tutorials
Best Computer Training Institute in Prayagraj (Allahabad)
O Level NIELIT Study material and Quiz
Bank SSC Railway TET UPTET Question Bank
career counselling in allahabad
Sarkari Exam Quiz
Website development Company in Allahabad