Package g0601_0700.s0637_average_of_levels_in_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    637 - Average of Levels in Binary Tree.

    Easy

    Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.

    Example 1:

    Input: root = 3,9,20,null,null,15,7

    Output: 3.00000,14.50000,11.00000 Explanation: The average value of nodes on level 0 is 3, on level 1 is 14.5, and on level 2 is 11. Hence return 3, 14.5, 11.

    Example 2:

    Input: root = 3,9,20,15,7

    Output: 3.00000,14.50000,11.00000

    Constraints:

    • The number of nodes in the tree is in the range <code>1, 10<sup>4</sup></code>.

    • <code>-2<sup>31</sup><= Node.val <= 2<sup>31</sup> - 1</code>

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

      • Methods inherited from class java.lang.Object

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