Round 1(Telephonic) 1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x. 2. Gievn a binary tree and return all root to leaf node pathss row,col and value. 3. He then asked me to give test cases for … Read More →
What’s going on ?