2018年12月7日
【leetcode】951. Flip Equivalent Binary Trees
摘要： 题目如下： For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree X is  阅读全文
posted @ 2018-12-07 17:53 seyjs 阅读(344) 评论(0) 推荐(0) 编辑