Coding
Lowest Common Ancestor on an N-ary Tree
Find the lowest common ancestor on an N-ary tree.
Input: root = [1,null,2,3,4], p = 2, q = 3
Output: 1
Explanation: Both nodes 2 and 3 are direct children of the root node 1, making 1 the lowest common ancestor.
Was asked at