首页 > 其他 > 详细

[LeetCode] Average of Levels in Binary Tree 二叉树的平均层数

时间:2017-07-30 15:30:02      阅读:215      评论:0      收藏:0      [点我收藏+]

 

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:

Input:
    3
   /   9  20
    /     15   7
Output: [3, 14.5, 11]
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].

 

Note:

  1. The range of node‘s value is in the range of 32-bit signed integer.

 

s

 

 

 

[LeetCode] Average of Levels in Binary Tree 二叉树的平均层数

原文:http://www.cnblogs.com/grandyang/p/7259209.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!