1. You can only use BINARY SEARCH TREE for this question. Write a function to find the kth smallest element in a BST. (For clarification see the sample input output below) The first line of the input will contain n (number of elements in the BST) and k. The next line contains n integers.

Q: Fibonacci Numbers Write an c program to compute the nth Fibonacci number. Fibonacci numbers are…

A: goto statement in C: It is a jump statement and is used to repeat some part of the program within a…

Q: What happens to the return value when a C function returns a 32-bit integer?

A: Introduction: Registers are a sort of computer memory used to accept, store, and transport data and…

Q: #include using namespace std; main () { int x, y, result; x = 50; y = 60; result = y - x; cout <«…

A: Given C++ code, #include &lt;iostream&gt;using namespace std;main() {    int x, y, result;    x =…

Q: ased on the following C code:       {       int x, y, z, sum, total;       int *pt1, *pt2, *ptc;…

A: 1{ 2 int x, y, z, sum, total; 3 int *pt1, *pt2, *ptc; 4 5 x = 99; 6 y = 86; 7 8 pt1 =…