Write a recursive (no loops allowed) routine to determine if ALL paths from leaves to root are the same length

earning Goal: I’m working on a c++ multi-part question and need an explanation and answer to help me learn.

Write a recursive (no loops allowed) routine to determine if ALL paths from leaves to root are the same length.

The tree nodes are instances of the following struct:

struct Node {

int key;

Node *left, *right;

};

However, for this application the key (or integer) in the node is not utilized and can be ignored.

The function is prototyped in equal-paths.h and should be implemented in the corresponding .cpp file :

// Prototype

bool equalPaths(Node * root);

More information on this homework assignment is attached in the PDF below.

All skeleton code is attached as well in the zip file.