二叉树的根到节点的距离

我必须找到二叉树的一个节点到其根的距离。

int distanceUtil(struct node* root, int x, int dist) {
    if (root == NULL) {
        return -1;
    }
    else {
        if (root->data == x) {
            return dist;
        }
        return distanceUtil(root->left, x, dist + 1) || distanceUtil(root->right, x, dist + 1);
    }
}

int distance(struct node* root, int x) {
    return distanceUtil(root, x, 0);
}

但它不起作用。事实上,大体上我是这样做的:

struct node* root = newNode(12);
root->left = newNode(8);
root->right = newNode(18);
root->left->left = newNode(2);
root->left->right = newNode(9);
root->right->left = newNode(15);
root->right->right = newNode(22);
root->right->right->right = newNode(33);
printf("il cammino : %d", distance(root,33));
getchar();
return 0;

它返回1,但应该返回3。有人能帮我吗? 谢谢。