4. In Query Tree, Leaf nodes are
1 poin
O a) Query
O b) Relations
O c) Internal nodes
O d) Parent node
Answers
Answered by
0
Answer:
All leaves are at the same level.
A B-Tree is defined by the term minimum degree ‘t’. The value of t depends upon disk block size.
Every node except root must contain at least (ceiling)([t-1]/2) keys. The root may contain minimum 1 key.
All nodes (including root) may contain at most t – 1 keys.
Number of children of a node is equal to the number of keys in it plus 1.
Similar questions
Computer Science,
1 month ago
Math,
1 month ago
Computer Science,
3 months ago
Hindi,
3 months ago
English,
9 months ago
Social Sciences,
9 months ago