Pergunta de entrevista da empresa Arista Networks

Had to write code to find the minimum element in a BST and also find the next largest element from the current node in the BST. Then had to explain what a function did (printed all the elements in the BST in increasing order). Also had to given the time complexities of all these functions.