码迷,mamicode.com
首页 > 其他好文 > 详细

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

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

标签:ati   node   example   return   div   form   exp   nat   val   

 

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 二叉树的平均层数

标签:ati   node   example   return   div   form   exp   nat   val   

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!