Phone interview did not ask frontend JavaScript questions, instead, they asked two algorithm problems ranging from easy to medium difficulty.
. Binary tree get the sum of numbers, number is composed of the path from root to leaf
For example, the root value is 1, the middle node value is 2, and the leaf node value is 3, the number composed is 123