zoukankan      html  css  js  c++  java
  • [LeetCode] 116

    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.
    • You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

    For 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) {
        while (root) {
          if (!root->left) {
            return;
          }
          for (TreeLinkNode *p = root; p != NULL; p = p->next) {
            p->left->next = p->right;
            p->right->next = p->next ? p->next->left : NULL;
          }
          root = root->left;
        }
      }
    };

  • 相关阅读:
    Oracle创建上下文 SYS_CONTEXT
    闪回版本查询
    物化视图创建案例
    Oracle 多租户环境学习路线图
    【Mysql MHA】CentOS7.6+Mysql8.0.16 入坑
    【翻译】--19C Oracle 安装指导
    Docker(3)---常用命令
    Docker(2)---安装(设置镜像加速器)
    Docker(1)---基础概念
    AMQP高级消息队列协议
  • 原文地址:https://www.cnblogs.com/shoemaker/p/4853206.html
Copyright © 2011-2022 走看看