A completely full B Tree with n=4, l=10 and height=2 (has levels 0, 1, 2) can have how many unique keys (Assume unique values are inserted)? Assume 0 based height. A tree with a single root node has a...

A completely full B Tree with n=4, l=10 and height=2 (has levels 0, 1, 2) can have how many unique keys (Assume unique values are inserted)?

Assume 0 based height. A tree with a single root node has a height = 0.

n = maximum children a node can have

l = maximum keys a node can have

What is the maximum number of unique keys that it can hold?

Calculate and give you answer here: _______