What is the best case time complexity of deleting a node in Singly Linked list? Q & A › Category: Data Structure › What is the best case time complexity of deleting a node in Singly Linked list? 0 Vote Up Vote Down Admin Staff asked 4 years ago What is the best case time complexity of deleting a node in Singly Linked list? a) O (n) b) O (n2) c) O (nlogn) d) O (1) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago d) O (1) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...