zoukankan      html  css  js  c++  java
  • #Leetcode# 116. Populating Next Right Pointers in Each Node

    https://leetcode.com/problems/populating-next-right-pointers-in-each-node/

    Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }
    

    Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

    Initially, all next pointers are set to NULL.

    Note:

    • You may only use constant extra space.
    • Recursive approach is fine, implicit stack space does not count as extra space for this problem.
    • You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

    Example:

    Given the following perfect binary tree,

         1
       /  
      2    3
     /   / 
    4  5  6  7
    

    After calling your function, the tree should look like:

         1 -> NULL
       /  
      2 -> 3 -> NULL
     /   / 
    4->5->6->7 -> NULL

    代码:

    /**
     * Definition for binary tree with next pointer.
     * struct TreeLinkNode {
     *  int val;
     *  TreeLinkNode *left, *right, *next;
     *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
     * };
     */
    class Solution {
    public:
        void connect(TreeLinkNode *root) {
             if(!root) return ;
            if(root -> left) {
                root -> left -> next = root -> right;
                if(root -> next)
                    root -> right -> next = root -> next -> left;
                
                connect(root -> left);
                connect(root -> right);
            }
            return;
        }
    };
    

      明天就是圣诞节啦!今天是睡到九点半的幸福的猪

  • 相关阅读:
    第一本书 第七章(课后题)
    java基础小测试
    随笔1
    随笔
    日记 晴 2017.7.30
    自我介绍
    与或非逻辑运算符 与或非位运算符
    日记1 天气阴 阵雨
    归并排序的两个版本实现代码
    Winedt打开tex文件报错error reading的解决方案
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10167558.html
Copyright © 2011-2022 走看看