摘要：
Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9 6 3 1 /** * Definition for a binary tree node. * public cl 阅读全文
posted @ 2019-08-28 09:53
Schwifty
阅读(118)
评论(0)
推荐(0)
摘要：
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 阅读全文
posted @ 2019-08-28 02:10
Schwifty
阅读(134)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the postorder traversal of its nodes' values. Example: LinkedList有addFirst方法，巧妙。 阅读全文
posted @ 2019-08-28 01:12
Schwifty
阅读(135)
评论(0)
推荐(0)
浙公网安备 33010602011771号