Home > Back-end >  The second from bottom of a binary tree numerical maximum value of the node
The second from bottom of a binary tree numerical maximum value of the node

Time:09-16

The second from bottom of a binary tree numerical maximum the value of the node (if insufficient depth layer 2 return 1 & lt; <31)
Tree nodes are defined as follows:
Typedef struct s_TreeNode {
Struct s_TreeNode * left;
Struct s_TreeNode * right;
The Int data;
} TreeNode.

Write the following functions:
{int maxinum_value_in_the_second_layer_from_the_end root TreeNode (*)
}

















  • Related