摘要：
/** * * @author gentleKay * Given a binary tree * Populate each next pointer to point to its next right node. If there is no next right node, the next 阅读全文
摘要：
/** * * @author gentleKay * Given a roman numeral, convert it to an integer. * Input is guaranteed to be within the range from 1 to 3999. * * 给定一个罗马数字 阅读全文
摘要：
/** * * @author gentleKay * Given two binary trees, write a function to check if they are equal or not. * Two binary trees are considered equal if the 阅读全文