Introduction
It took the peer 60 minutes to write a solution to find binary search tree inorder successor on Oct. 31, 2017. One time the peer asked me who I am, are you a teacher? I must be very patient and be very supportive.
In fact, I understood that I failed at least 30% of algorithm in the first round of mock interview starting this March. So it is very easy for me to relate to my performance, I am in trouble, and have some difficult time to solve the algorithm.
Algorithm study
Plan to study the binary search tree inorder successor algorithm. Read as many discussion as possible, here is the Leetcode discussion link.
No comments:
Post a Comment