← Goldman Sachs questions

DFS on Tree with Doubly Linked List Last Level

Filed under Goldman Sachs

Perform a Depth First Search (DFS) on a non-binary tree where the leaf nodes are connected to form a circular doubly linked list.

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 Goldman Sachs questions

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