Google实习电面

[161616Q]

做了两题：

1. expression tree: with -/+ as intermediate nodes and variable name as leaves. Given two expression trees, determine if they are same when evaluated
2. Given a circularly linked list, remove every other node，意思是每隔一个删一个