Binary Tree -- width Calculation

# Define M 10 // assume that the maximum number of layers of a binary tree is int width (bintree t) {int static N [m]; // The vector stores the number of nodes at each layer. Int static I = 1; int static max = 0; // The maximum width if (t) {if (I = 1) // if the root node is accessed {n [I] ++; // Add 1 I ++ to Layer 3; // to Layer 3 if (t-> lchild) // if there is a left child, add 1 N [I] ++ to the layer; if (t-> rchild) // if there is a right child, add 1 N [I] ++ to the layer;} else {// access the subtree node I ++; // Number of knots in the next layer if (t-> lchild) N [I] ++; If (t-> rchild) N [I] ++ ;} if (max <n [I]) max = N [I]; // retrieve the maximum width (t-> lchild); // traverse the left subtree I --; // return a layer of width (t-> rchild); // traverse the right subtree} return Max ;}//AlgorithmEnd