| 111 | } |
| 112 | |
| 113 | int countnodes(binarytree<int> *root) |
| 114 | { |
| 115 | if(root==NULL) |
| 116 | return 0; |
| 117 | |
| 118 | return 1 + countnodes(root->left) + countnodes(root->right); |
| 119 | } |
| 120 | |
| 121 | void postoder(binarytree<int>*root) |
| 122 | { |
nothing calls this directly
no outgoing calls
no test coverage detected