摘要：
Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [3,2,1]. 牛解法：postorder就是L-R- 阅读全文
posted @ 2016-10-06 01:42
Hygeia
阅读(163)
评论(0)
推荐(0)
摘要：
题目： Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [1,2,3]. Note: Recursive 阅读全文
posted @ 2016-10-06 01:39
Hygeia
阅读(260)
评论(0)
推荐(0)
摘要：
题目： Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [1,3,2]. Note: Recursive s 阅读全文
posted @ 2016-10-06 01:35
Hygeia
阅读(241)
评论(0)
推荐(0)
浙公网安备 33010602011771号