Package g0201_0300.s0257_binary_tree_paths

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    257 - Binary Tree Paths.

    Easy

    Given the root of a binary tree, return all root-to-leaf paths in any order.

    A leaf is a node with no children.

    Example 1:

    Input: root = 1,2,3,null,5

    Output: "1->2->5","1->3"

    Example 2:

    Input: root = 1

    Output: "1"

    Constraints:

    • The number of nodes in the tree is in the range [1, 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 List<String> binaryTreePaths(TreeNode root)

      • Methods inherited from class java.lang.Object

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