Convert a BST to a Sorted Circular Doubly Linked List
Company: Apple
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Relink a binary search tree in place into a sorted circular doubly linked list using the existing child pointers. Return the smallest node, connect both ends in both directions, and handle empty, single-node, and deeply skewed trees.
Read the full Apple Software Engineer interview experience this question came from