【LeetCode】623.Add One Row to Tree(Medium)解题报告

最新推荐文章于 2019-02-15 00:33:00 发布

郝春雨

最新推荐文章于 2019-02-15 00:33:00 发布

阅读量176

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/78639040

版权

LeetCode 专栏收录该内容

183 篇文章 0 订阅

订阅专栏

【LeetCode】623.Add One Row to Tree(Medium)解题报告

题目地址：https://leetcode.com/problems/add-one-row-to-tree/description/
题目描述：

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.
The adding rule is: given a positive integer depth d, for each NOT null tree nodes N in depth d-1, create two tree nodes with value v as N’s left subtree root and right subtree root. And N’s original left subtree should be the left subtree of the new left subtree root, its original right subtree should be the right subtree of the new right subtree root. If depth d is 1 that means there is no depth d-1 at all, then create a tree node with value v as the new root of the whole original tree, and the original tree is the new root’s left subtree.

Example1:
Input: 
A binary tree as following:
       4
     /   \
    2     6
   / \   / 
  3   1 5   

v = 1

d = 2

Output: 
       4
      / \
     1   1
    /     \
   2       6
  / \     / 
 3   1   5

Example2: 
Input:
A binary tree as following:
      4
     /   
    2    
   / \   
  3   1    

v = 1

d = 3

Output: 
      4
     /   
    2
   / \    
  1   1
 /     \  
3       1

Note:
The given d is in range [1, maximum depth of the given tree + 1].
The given binary tree has at least one tree node.

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode addOneRow(TreeNode root, int v, int d) {
        if(d==1){
            TreeNode newRoot = new TreeNode(v);
            newRoot.left = root;
            return newRoot;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int depth = 1;
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i=0 ; i<size ; i++){
                TreeNode top = queue.poll();
                if(depth == d-1){
                    TreeNode left = new TreeNode(v);
                    TreeNode right = new TreeNode(v);
                    if(top.left!=null){
                        left.left = top.left;
                    }
                    if(top.right!=null){
                        right.right = top.right; 
                    }
                    top.left = left;
                    top.right = right;
                    continue;
                }
                if(top.left!=null){
                    queue.offer(top.left);
                }
                if(top.right!=null){
                    queue.offer(top.right);
                }   
            }
            depth++;
        }
        return root;
    }
}

树的层序遍历，要记住模板。

int size = queue.size();
for(int i=0 ; i<size ; i++）{
    TreeNode top = queue.size();
    if(top.left!=null){
        queue.offer(top.left);
    }
    if(top.right!=null){
        queue.offer(top.right);
    }
}