摘要: Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree. 阅读全文
posted @ 2018-04-25 18:02 赖兴宇 阅读(191) 评论(0) 推荐(0) 编辑
摘要: 相同的树 same tree 阅读全文
posted @ 2018-04-25 15:14 赖兴宇 阅读(606) 评论(0) 推荐(0) 编辑
摘要: 找出树每一行的最大值 You need to find the largest value in each row of a binary tree. leetcode 515 阅读全文
posted @ 2018-04-25 14:32 赖兴宇 阅读(286) 评论(0) 推荐(0) 编辑