← Microsoft questions

Delete node given address, nth from end, and validate BST

Filed under Microsoft

Given only the address of a node in a singly linked list (not the head), delete that node. Also, find the nth node from the end of a singly linked list and check whether a binary tree is a valid BST.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.