write a Boolean function that is given a binary tree and returns true and only if an even number of nodes. An empty tree is considered to have an even number of nodes:
The function should have just one argument, a pointer to the root.
No global variables may be used.
No additional functions may be defined. You may not count the number of nodes.
I can solve your problem within 1 day. Quickly and well. I have a lot of experience with C++ and algorithms. I have recently graduated from the second-best IT university in Europe (University of Warsaw).
Hi,
I am able to write a Boolean function that takes a binary tree as input (pointer to the root) and returns true if there are even number of nodes.
If you believe I am the right candidate for this project, please contact me soon!
Thanks,
Sourabh