Recursive c++ function to print out the elements of a fibonacci tree

Question

So far I have been able to use recursion to print out the fibonacci sequence. For example, the first 6 terms (including the 0'th term) in the sequence is:

13 8 5 3 2 1 1

but Im not sure how i'm supposed to use this to print out the entirety of a fibonacci tree. When the program input is 6, it's supposed to print:

6
13 8 5 3 2 1 1 1 2 1 1 3 2 1 1 1 5 3 2 1 1 1 2 1 1

and my code so far is:

#include <iostream>
#include <math.h>
#include <vector>
#include <string>

using namespace std;

std::vector<int> list;

int fib(int num);

int main() {
    int input, depth = 0, leafs = 0, size = 0;

    cin >> input;
    int temp = input;

    while (temp >= 0) {
        cout << fib(temp) << " ";
        temp--;
    }


    return 0;
}

int fib(int n) {
    if (n <= 1) {
        return 1;
    } else {
        return fib(n-1) + fib(n-2);
    }
}

IMHO your stop condition seems wrong should be: if (n <= 2) { return n;} — OznOg, Nov 25 '18 at 12:39

score 1 · Answer 1 · answered Nov 25 '18 at 12:36

If you want to print everything, you need also to all the function to print everything:

int fib(int n) {
    if (n <= 1) {
        std::cout << 1 << " ";
        return 1;
    } else {
        int f1 = fib(n-1);
        int f2 = fib(n-2);
        std::cout << f1 + f2 << " ";
        return f1 + f2;
    }
}

Recursive c++ function to print out the elements of a fibonacci tree

1 Answers1