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;
        }
      }
    };

  • 相关阅读:
    JS常见错误和分析
    angularjs 笔记(1) -- 引导
    各大浏览器hack
    AngularJS 配置和运行phonecat错误
    npm start 作用
    $.prop()和$.attr() 区别用法
    HDU 1251 统计难题 (Tire树)
    Luogu P3370 【模板】字符串哈希
    Luogu P3385 【模板】负环
    LuoguP1563 玩具谜题
  • 原文地址:https://www.cnblogs.com/shoemaker/p/4853206.html
Copyright © 2011-2022 走看看