返回一棵二叉搜索树中最深的结点的指针C语言

static Node * search_the_deepmost_node (const Tree tree) { Node * left_node, * right_node ; if (tree != NULL) { left_node = search_the_deepmost_node (tree -> left) ; right_node = search_the_deepmost_node (tree -> right) ; if (NULL == left_node && NULL == right_node) return tree ; else if (NULL == left_node) return right_node ; else if (NULL == right_node) return left_node ; else return left_node -> depth >= right_node -> depth ? left_node : right_node ; } else return NULL ; }