Ceil in a BST.cpp

#include <bits/stdc++.h> 
/************************************************************

    Following is the TreeNode class structure:

    class BinaryTreeNode {
    public:
        T data;
        BinaryTreeNode<T> *left;
        BinaryTreeNode<T> *right;
        
        BinaryTreeNode(T data) {
            this->data = data;
            left = NULL;
            right = NULL;
        }
        
        ~BinaryTreeNode() {
            if (left) {
              delete left;
            }
            if (right) {
              delete right;
            }
        }
    };

************************************************************/

int findCeil(BinaryTreeNode<int> *node, int key){
    // Write your code here.
    BinaryTreeNode<int>* temp=node;

    int ceil=-1;

    while(temp){
        if(temp->data==key){
            ceil=temp->data;
            return ceil;
        }
        if(key>temp->data) temp=temp->right;
        else{
            ceil=temp->data;
            temp=temp->left;
        }
    }
    return ceil;
}