2018年12月19日
#Leetcode# 951. Flip Equivalent Binary Trees
摘要： https://leetcode.com/problems/flip-equivalent-binary-trees/ For a binary tree T, we can define a flip operation as follows: choose any node, and swap 阅读全文
posted @ 2018-12-19 17:29 _Zlrrr 阅读(188) 评论(0) 推荐(0)
#Leetcode# 145. Binary Tree Postorder Traversal
摘要： https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the postorder traversal of its nodes' values. Example: Foll 阅读全文
posted @ 2018-12-19 17:02 _Zlrrr 阅读(114) 评论(0) 推荐(0)