二叉树查询节点所在层数

#include <stdio.h>

typedef int ElementType;

struct BinarySearchTreeNode
{
    ElementType Element;
    struct BinarySearchTreeNode *Left;
    struct BinarySearchTreeNode *Right;
};

//if doesn't find,return -1,TreeRoot is 0
int BinarySearchTreeNodeFindLevel(struct BinarySearchTreeNode *TreeRoot,struct BinarySearchTreeNode *NodeToBeFind)
{
    if(TreeRoot == NULL || NodeToBeFind == NULL)
    {
        return -1;
    }
    if(TreeRoot -> Element == NodeToBeFind -> Element)
    {
        return 0;
    }
    
    int Level = BinarySearchTreeNodeFindLevel(TreeRoot -> Left,NodeToBeFind);
    if(Level == -1)
    {
        Level = BinarySearchTreeNodeFindLevel(TreeRoot -> Right,NodeToBeFind);
    }
    if(Level != -1)
    {
        return (Level+1);
    }
    return -1;
}

int main()
{
    //int LevelNum = BinarySearchTreeNodeFindLevel(TreeRoot,BinarySearchTreeNodeFind(39,TreeRoot));
    //printf("%d
",LevelNum);
    return 0;
}