Description: Write effective function, which accepts a pointer to the root of the binary tree T and computing: a. (1) the number of T leaves (2) contains a non-NULL number of nodes in the node number of sub-T Bay (3) he has two non-empty children in T
To Search:
File list (Check if you may need any files):
tree
....\btree.h
....\main.cpp