Package g0201_0300.s0226_invert_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    226 - Invert Binary Tree.

    Easy

    Given the root of a binary tree, invert the tree, and return its root.

    Example 1:

    Input: root = 4,2,7,1,3,6,9

    Output: 4,7,2,9,6,3,1

    Example 2:

    Input: root = 2,1,3

    Output: 2,3,1

    Example 3:

    Input: root = []

    Output: []

    Constraints:

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

    • -100 <= Node.val <= 100

    • 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 TreeNode invertTree(TreeNode root)

      • Methods inherited from class java.lang.Object

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