How can you calculate tree density?

Answer 1

Something like this:

int depth (const Tree *root)

{

int l, r;

if (root==NULL) return 0;

l= depth (root->left);

r= depth (root->right);

if (l>r) return return 1+l;

else return 1+r;

}

Answer 2

You recursively descend the tree, taking every possible path, counting the number of nodes, finding the maximum.

Well, that's how to measure it. To calculate it, consider this...

For an ideally balanced binary tree of depth D, the number of nodes N is 2D - 1. Solving for D...

N = 2D - 1

N + 1 = 2D

log2 (N + 1) = D

Answer 3

Weigh it, calculate its volume, then calculate density.