Thread: Help! Please

Hi,

Currently I am working on this problem and am thinking of the best way to solve it... please help me with some tips as to what would be a reasonable way of solving the problem efficiently.

lets say I have an equation such as:

a1=a6*a1*b9*b7/(c14+d7) + (b7*a6*f10-g8*h12).....................can be as big as having 100 elements.

I need to be able to count the number of elements in the equation such as in this case it is : 9 , each unique term needs to be counted only once irrespective of how many times it has occured in the equation.

What would be a good way to solve this problem?

Binary Tree