CodingReported in a candidate post, Mar 2024
BST Inorder Traversal using Parent Pointers
Filed under Arista Networks
The question
Given a binary search tree variant where nodes include an additional parent pointer, implement functions to find the minimum value node, the next node in an inorder traversal for a current node, and perform the inorder traversal using these functions.
No write-up yet. Related questions below have one.
Related Arista Networks questions
Collected from public candidate posts and coding forums. Updated Nov 2026.