zoukankan      html  css  js  c++  java
  • Leetcode

    Leetcode - 623 - Add One Row to Tree

    623. Add One Row to Tree

    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 vas 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.

    Example 1:

    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   
    
    

    Example 2:

    Input: 
    A binary tree as following:
          4
         /   
        2    
       /    
      3   1    
    
    v = 1
    
    d = 3
    
    Output: 
          4
         /   
        2
       /     
      1   1
     /       
    3       1
    

    Note:

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

    题解: 

      一般 tree 的问题都使用recursion 来解决。 注意在root 与 child 之间插入node的区别。 

    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        TreeNode* addOneRow(TreeNode* root, int v, int d) {
            if(d == 1){
                TreeNode *ans = new TreeNode(v); 
                ans->left = root; 
                return ans; 
            }else if(d == 2){
                TreeNode *lf = new TreeNode(v); 
                lf->left = root->left; 
                lf->right = NULL; 
                root->left = lf; 
                
                TreeNode *rg = new TreeNode(v); 
                rg->right = root->right; 
                rg->left = NULL; 
                root->right = rg;
                
                return root; 
            }else{
                if(root->left != NULL){
                    addOneRow(root->left, v, d-1); 
                }
                if(root->right != NULL){
                    addOneRow(root->right, v, d-1); 
                }
            }
            return root; 
        }
    };
    

      

  • 相关阅读:
    nyoj17 单调递增最长子序列
    第四届蓝桥杯预赛:第39级台阶
    一个cout引发的血案
    TensorFlow-warning-Your CPU supports instructions that this TensorFlow binary was not compiled to use: AVX2 FMA
    kaldi部署过程
    TensorFlow 在 Anaconda3 Spyder Win10 环境下安装使用及问题解决
    多线程
    通过函数名后加const重载的函数如何区分调用
    语音分帧时设置相邻帧部分重叠的原因
    第二章 线性代数
  • 原文地址:https://www.cnblogs.com/zhang-yd/p/7067238.html
Copyright © 2011-2022 走看看