leetcode/problemset/binary-tree-postorder-traversal.js at develop · imcoddy/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/**
 * Source:  https://leetcode.com/problems/binary-tree-postorder-traversal/
 * Tags:    [Tree,Stack]
 * Level:   Hard
 * Title:   Binary Tree Postorder Traversal
 * Auther:  @imcoddy
 * Content: 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: Recursive solution is trivial, could you do it iteratively?
 *
 *
 *                   Subscribe to see which companies asked this question
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *                   Show Similar Problems
 *
 *
 *                      (M) Binary Tree Inorder Traversal
 */

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[]}
 */
var postorderTraversal = function(root) {

};