丧心病狂工科女

摘要： 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 阅读全文

摘要： https://leetcode.com/problems/binary-tree-postorder-traversal/ Given a binary tree, return the postorder traversal of its nodes' values. Example: Foll 阅读全文