Question

Suppose a binary tree t is in memory. Write a procedure which deletes all the terminal nodes in T.​

Answer 1

Answer:

//Fibonacci Series using Recursion

#include<bits/stdc++.h>

using namespace std;

  

int fib(int n)

{

    if (n <= 1)

        return n;

    return fib(n-1) + fib(n-2);

}

  

int main ()

{

    int n = 9;

    cout << fib(n);

    getchar();