Print all ancestors of a given node in a binary tree?

Short answer: bool PrintAncestors(TreeNode root, int target) { if (root == null) return false; if (root.val == target) return true; if (PrintAncestors(root.left, target) || PrintAncestors(root.right, target)) { Console.Write(root.val + " "); return true; } return false; } Explanation: Recursive check if target is in subtree; print current node on path back if yes.

Example code

bool PrintAncestors(TreeNode root, int target) { if (root == null) return false;
if (root.val == target) return true;
if (PrintAncestors(root.left, target) || PrintAncestors(root.right, target)) { Console.Write(root.val + " "); return true;
}
return false;
} Explanation: Recursive check if target is in subtree; print current node on path back if yes.

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.