/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private int ans;
    
    private void dfs(TreeNode cur, int level, int idx, List<Integer> leftIds) {
        if (cur == null) {
            return;
        }
        if (leftIds.size() == level) {
            leftIds.add(idx);
        }
        ans = Math.max(ans, idx - leftIds.get(level) + 1);
        dfs(cur.left, level + 1, idx * 2, leftIds);
        dfs(cur.right, level + 1, idx * 2 + 1, leftIds);
    }
    
    public int widthOfBinaryTree(TreeNode root) {
        if (root == null) {
            return 0;
        }
        ans = 1;
        List<Integer> leftIds = new ArrayList<>();
        dfs(root, 0, 1, leftIds);
        return ans;
    }
}