TreeNode* searchBST(TreeNode* root, int val) {
    while (root && root->val != val) {
        root = (val < root->val)? root->left : root->right;
    }
    return root;
}