0.
Suppose there is a B tree of order 'k'
, how many keys will the nodes of this tree contain, if the node is not a root node?
Answer:
Answers
Answered by
0
Answer:
The B tree of order 'k' will contains atleast (k-1)/2 keys, if the node is not a root node.
Explanation:
- A balanced order-n multiway search tree in which each nonroot node contains at least (n-1)/2 keys is called a B-tree of order n.
- This reflects the fact that each node in the tree has a maximum of (n-1) keys and n sons.
- A B-tree of order 12 will have at least 5 keys in each non-root nodes.
Answered by
0
Answer:
k-1 keys.
Explanation:
CONCEPT:B-tree is a self-balancing search tree that allows all operations i.e. searching, insertion, deletion in logarithmic(log) time.
A B-tree of order m must satisfy the following properties:
Every node can have maximum m children.
Every internal node (except root) can have at least ⌈m/2⌉ child nodes.
The root, if not a leaf node, can have at least two children.
An internal node with k children contains k − 1 key.
All leaf nodes must be at the same level.
Hence, if a node has K children in B tree, then the node contains exactly k-1 keys.
#SPJ2
Similar questions