Amazon interview question
Perform a depth first search on a binary tree.
Interview Answer
Anonymous
14 Jan 2020
Given an infinite stream of integers, write three functions receiveInteger(int x), findMiddle(), deleteMiddle().
Perform a depth first search on a binary tree.
Anonymous
Given an infinite stream of integers, write three functions receiveInteger(int x), findMiddle(), deleteMiddle().
Check out your Company Bowl for anonymous work chats.