Place the following sequence of elements in an empty binary search tree (BST): 26, 44, 63, 83,17, 19, 8, 41, 37, 21, 14,

[answerhappygod]

Place the following sequence of elements in an empty binary
search tree (BST): 26, 44, 63, 83,17, 19, 8, 41, 37, 21, 14, 5, 13,
16.
Below are a number of questions about the resulting binary
search tree. Indicate which statement (s) are correct.
A. The leaves of the tree contain elements 5, 13, 16, 21, 37 and
83.
B. The leaves of the tree contain elements 5, 13, 16, 19, 37 and
83.
C. The tree has a height of 3.
D. A BST containing 14 elements has a height of at least 3 and
at most 13.
Group of answer options
Only statements B and D are correct.
Only statements B, C and D are correct.
Only statement D is correct.
Only statements A, C and D are correct.
Only statements A and D are correct.