1 | initial version |
Hi, I think th eproblem is if we have a tree or not, there is plenty of if( c->tree). In th esecond example no tree is built if I'm not mistaken. Hence it goes faster but does not print any information. Best regards Anders
2 | No.2 Revision |
Hi,
I think th eproblem the problem is if we have a tree or not, not; there is plenty of if( c->tree). if(c->tree)
. In th esecond example the second example, no tree is built if I'm not mistaken. Hence it goes faster but does not print any information.
Best regards
Anders