SAP Interview Question

Give the minimum height of a binary search tree?

Interview Answers

Anonymous

Feb 4, 2016

Breadth-first search queuing up child nodes, then keep separate counters to track # of children in each level to help in determining level of tree. Once you hit a node with no children, return the level

1

Anonymous

Apr 4, 2019

minimum height of a binary search tree is log2(n)