1p3a
Question
·
Oct 2025
Apple Phone Screen for Machine Learning Engineer: Convert Sorted Linked List to BST
Question Details
Problem Statement Construct a height-balanced Binary Search Tree (BST) from a sorted singly linked list. The resulting tree must satisfy the condition that the depth of the two subtrees of every n
Full Details
🔒
Unlock all Apple questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a apple interview for a swe role during the phone screen round reported in 2025.
It covers the following topics: Binary Search, Binary Tree, Linked List, Ml, Recursion .