Binary Tree Postorder Traversal
Total Accepted: 28560 Total
Submissions: 92333My Submissions
Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given...
分类：
其他好文 时间：
2014-09-05 16:09:01
阅读次数：
172
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For e...
分类：
其他好文 时间：
2014-09-03 21:13:57
阅读次数：
142
问题描述
Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [3,2,1].
Note: Recur...
分类：
其他好文 时间：
2014-09-02 21:23:55
阅读次数：
317
问题描述
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,2,3].
Note: Recurs...
分类：
其他好文 时间：
2014-09-02 17:50:45
阅读次数：
136
LeetCode: Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}...
分类：
其他好文 时间：
2014-08-31 22:38:11
阅读次数：
215
LeetCode: Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to...
分类：
其他好文 时间：
2014-08-27 23:10:28
阅读次数：
316
LeetCode: Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level ...
分类：
其他好文 时间：
2014-08-27 21:55:48
阅读次数：
326
