pls answer these mcqs

21. The maximum possible height of a binary search tree with n nodes is

a. n

b. log n

c. n2

d. n-2

22. What is the worst-case performance of the add method in a binary search tree with linked nodes?

a. O(n)

b. O(1)

c. O(log n)

d. O(n2)

23. What is the worst-case performance of the remove method in a binary search tree with linked nodes?

a. O(n)

b. O(1)

c. O(log n)

d. O(n2)

24. What is the worst-case performance of the getEntry method in a binary search tree with linked nodes?

a. O(n)

b. O(1)

c. O(log n)

d. O(n2)

25. What is the worst-case performance of the add method in a full binary search tree with linked nodes?

a. O(log n)

b. O(n)

c. O(1)

d. O(n2)

26. What is the worst-case performance of the remove method in a full binary search tree with linked nodes?

a. O(log n)

b. O(n)

c. O(1)

d. O(n2)

27. What is the worst-case performance of the getEntry method in a full binary search tree with linked nodes?

a. O(log n)

b. O(n)

c. O(1)

d. O(n2)