LeetCode.662 Maximum Width of Binary Tree

题目：

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.

分析：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int widthOfBinaryTree(TreeNode root) {
        //给定二叉树，返回其最宽的一层的宽度
        //思路：即通过父节点，确定左孩子2*i,右孩子2*i+1。通过记录该层最开始和最末尾的下表，相减即为结果。
        if(root==null) return 0;
        
        List<Integer> start=new ArrayList<>();
        List<Integer> end=new ArrayList<>();
        
        return backtrace(root,0,1,start,end);
        
    }
    //递归实现
    public int backtrace(TreeNode root,int level,int parentIndex,List<Integer> start,List<Integer> end){
        if(root==null) return 0;
        if(start.size()==level){
            //说明新的一层,记录父节点下表
            start.add(parentIndex);
            end.add(parentIndex);
        }else{
            //更新最新末尾
            end.set(level,parentIndex);
        }
        int cur=end.get(level)-start.get(level)+1;
        //递归
        int left=backtrace(root.left,level+1,parentIndex*2,start,end);
        int right=backtrace(root.right,level+1,parentIndex*2+1,start,end);
        return Math.max(cur,Math.max(left,right));
    }
}