Received a phone call on time. First, talk about my project and what is the most challenging part in my project. Second, talk about Binary Search Tree, write code on shared document to implement a function which determine whether two BSTs contain same node value(equality). Third, if we need to check equality of BST frequently, how to deal with it. In best case we can check equality in O(1).