A completely full B Tree with n=4, l=10 and height=2 (has le…

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

You are given a Binary Search Tree with elements A-H which a…

You are given a Binary Search Tree with elements A-H which are variables that have values satisfying the BST invariants.                              A                       /             \                  B                    D                       \              /      \                         C       E            G                                /             /                              F           H What is/are the possible root element(s) after we delete “A”? Select all that apply.