Hey guys,

The question on the homework is

"Write a function that returns a count of the nodes that contain a value less than the parameter value."

I was wondering if someone could point me in the right direction maybe with some pseudo code or something of the like. ive got

```
int lessNodeCount(int value) const
{
int count = 0;//count for the number of nodes to be updated
```

Im just confused about whether it should be done recursively or not. I know i have to find the value in the tree, move to the left child and count every node stemming from that left child. Im just not sure how to accomplish that.