#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>

typedef struct node
{
    int data;
    struct node *lc, *rc;
} LNode, *BiTree;

int findLevel(BiTree b, int x)
{
    int n = 0;
    if (b != NULL)
    {
        while (b->data != x)
        {
            if (b->data < x)
            {
                b = b->rc;
            }
            else if (b->data > x)
            {
                b = b->lc;
            }
            n++;
        }
    }
    return n;
}