Package g0101_0200.s0145_binary_tree_postorder_traversal

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    145 - Binary Tree Postorder Traversal\.

    Easy

    Given the root of a binary tree, return the postorder traversal of its nodes' values.

    Example 1:

    Input: root = 1,null,2,3

    Output: 3,2,1

    Example 2:

    Input: root = []

    Output: []

    Example 3:

    Input: root = 1

    Output: 1

    Constraints:

    • The number of the nodes in the tree is in the range [0, 100].

    • -100 <= Node.val <= 100

    Follow up: Recursive solution is trivial, could you do it iteratively?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<Integer> postorderTraversal(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait