**What is the maximum and minimum no of keys can be present in leaf nodes in B trees if the order of the B tree is p?**

GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation

0 votes

0 votes

a B-tree of order m is a tree which satisfies the following properties:

- Every node has at most m children.
- Every non-leaf node (except root) has at least ceil(m⁄2) children.
- The root has at least two children if it is not a leaf node.
- A non-leaf node with k children contains k−1 keys.
- All leaves appear in the same level, and carry information.

- All categories
- Computer Science & Information Technology 451
- Mathematics 80
- Aptitude Questions 114
- GATE 94
- Online Aptitude Test 6
- Gate Exam 22
- Gate Syllabus 6
- Gate Preparation 35
- Gate Coaching 14
- Online Registration 20
- Electronics and Communication (EC) 0
- Electrical Engineering (EE) 3
- Civil Engineering (CE) 0
- Mechanical Engineering (ME) 2
- Aerospace Engineering (AE) 0
- Agricultural Engineering (AG) 0
- Architecture and Planning (AR) 0
- Biotechnology (BT) 0
- Chemical Engineering (CH) 1
- Chemistry (CY) 0
- Ecology and Evolution (EY) 0
- Geology and Geophysics (GG) 0
- Instrumentation Engineering (IN) 0
- Mining Engineering (MN) 0
- Petroleum Engineering (PE) 0
- Physics (PH) 0
- Production and Industrial Engineering (PI) 1
- Textile Engineering and Fibre Science (TF) 0
- Engineering Sciences 0
- Life Sciences 1
- Mathematics (MA) 0