Count the number of nodes at each layer of a binary tree

# Include <stdio. h> # include <stdlib. h ># include <vector> using namespace STD; struct treenode {int data; treenode * left; treenode * Right ;}; // count the number of nodes at each layer. Int res; void countnumoflevel (treenode * root, int depth) {If (root = NULL | depth <0) return; If (depth = 0) {res ++; return ;} countnumoflevel (root-> left, depth-1); countnumoflevel (root-> right, depth-1);} int main () {res = 0; treenode * t = new treenode; t-> DATA = 1; treenode * T1 = new treenode; T1-> DATA = 2; treenode * t2 = new treenode; t2-> DATA = 3; t-> left = T1; t-> right = t2; treenode * T3 = new treenode; T3-> DATA = 4; treenode * t4 = new treenode; T4-> DATA = 5; T1-> left = T3; T1-> right = T4; t2-> left = NULL; t2-> right = NULL; countnumoflevel (T, 2); printf ("% d \ n", Res); Delete t; Delete T1; Delete T2; Delete T3; delete T4; System ("pause"); Return 0 ;}