if (!root) return nullptr; if (key < root->val) { root->left = deleteNode(root->left, key); } else if (key > root->val) { root->right = deleteNode(root->right, key); } else { // Node to be deleted found if (!root->left) { TreeNode* rightChild = root->right; delete root; return rightChild; } if (!root->right) { TreeNode* leftChild = root->left; delete root; return leftChild; }

    TreeNode* minNode = root->right;
    while (minNode->left) minNode = minNode->left;
    root->val = minNode->val;
    root->right = deleteNode(root->right, minNode->val);
}
return root;

}

public static SinglyLinkedListNode? deleteNode(SinglyLinkedListNode? llist, int position) { if(llist == null) { return null; }

    if(position == 0)
    {
        return llist.next;
    }

    int currentPosition =0;
    SinglyLinkedListNode? current = llist;
    while( current !=null && current.next != null && currentPosition < position-1)
    {
        current = current.next;
        currentPosition++;
    }

    if (current == null || current.next == null)
    {
       return llist;
    }        

    current.next = current.next.next;       
    return llist;     
}

it show: error CS0103: The name 'deleteNode' does not exist in the current context....

Computer Fundamentals

if(llist == null) return null;

    if(position == 0){
        SinglyLinkedListNode newHead = llist.next;
        llist.next = null;
        return newHead;
    }

    SinglyLinkedListNode curr = llist;
    for(int i = 0; i < position; i++){
        if(i == position - 1){
            curr.next = curr.next.next;
        } else curr = curr.next;
    }
    return llist;

Java 8 Solution:

public static SinglyLinkedListNode deleteNode(SinglyLinkedListNode llist, int position) {
        if (position == 0) {
            llist = llist.next;
            return llist;
        }
        SinglyLinkedListNode current = llist;
        llist = current;
        
        int index = 0;
        while (index < position - 1) {
            current = current.next;
            index++;
        }
        current.next = current.next.next;
        return llist;
    }