Linkedin二面面经

2014.10, by NANA1123

第一个题是很简单的pow,

第二题题目Given  a root of a tree. The tree may be of any depth and width. Transform it in a way that each node(except probably one) would either have N or 0 children
还有一个条件：父子关系不能颠倒（但可以为sibling）