You are given a Binary Search Tree with 7 elements whose val…

You are given a Binary Search Tree with 7 elements whose values satisfy the BST properties.                              19                       /             \                  8                    25                       \              /      \                         9       23          28                                /             /                              20          26 What is/are the possible replacement of the root node if we delete the root node? Select all that apply. Alt Text for the above Tree: The image depicts a binary tree with the following structure:- The root node has value 19.- 19 has two children: 8 on the left and 25 on the right.- 8 has one right child with value 9.- 25 has two children: 23 on the left and 28 on the right.- 23 has one left child with value 20.- 28 has one left child with value 26.

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 which satisfy the BST properties.                              A                       /             \                  B                    C                       \              /      \                         D       E            F                                /             /                              G           H What is/are the possible replacement of node “A” after we delete “A”? Select all that apply. Alt Text for the above Tree: The image depicts a binary tree with the following structure:- The root node is labeled A.- A has two children: B on the left and C on the right.- B has one right child labeled D.- C has two children: E on the left and F on the right.- E has one left child labeled G.- F has one left child labeled H.

What type of rotation(s) will occur after searching for 31 i…

What type of rotation(s) will occur after searching for 31 in the following Splay Tree?                             5                         /       \                      0            70                                  /      \                              43       1000                           /                      31 Select all that apply:

What is the greatest number of unique keys a perfect B+ Tree…

What is the greatest number of unique keys a perfect B+ Tree with n=4, l=40 and height=2 (has levels 0, 1, 2) can have (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 leaf node can have