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

[LeetCode] Maximum Width of Binary Tree 二叉树的最大宽度

时间:2017-09-18 01:18:26      阅读:240      评论:0      收藏:0      [点我收藏+]

标签:nbsp   where   bit   between   fun   put   tput   code   tco   

 

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tree, but some nodes are null.

The width of one level is defined as the length between the end-nodes (the leftmost and right most non-null nodes in the level, where the null nodes between the end-nodes are also counted into the length calculation.

Example 1:

Input: 

           1
         /           3     2
       / \     \  
      5   3     9 

Output: 4
Explanation: The maximum width existing in the third level with the length 4 (5,3,null,9).

Example 2:

Input: 

          1
         /  
        3    
       / \       
      5   3     

Output: 2
Explanation: The maximum width existing in the third level with the length 2 (5,3).

Example 3:

Input: 

          1
         /         3   2 
       /        
      5      

Output: 2
Explanation: The maximum width existing in the second level with the length 2 (3,2).

Example 4:

Input: 

          1
         /         3   2
       /     \  
      5       9 
     /             6           7
Output: 8
Explanation:The maximum width existing in the fourth level with the length 8 (6,null,null,null,null,null,null,7).


Note: Answer will in the range of 32-bit signed integer.

 

s

 

[LeetCode] Maximum Width of Binary Tree 二叉树的最大宽度

标签:nbsp   where   bit   between   fun   put   tput   code   tco   

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

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