zoukankan      html  css  js  c++  java
  • 【Leetcode】【Medium】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.
    • 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

    解题思路:

    建立两个指针,一个指针用于操作父节点,给孩子结点的next赋值;一个指针用于指向每层的首个结点;

    当操作结点处理完一层后,继续处理下一层。

    代码:

     1 /**
     2  * Definition for binary tree with next pointer.
     3  * struct TreeLinkNode {
     4  *  int val;
     5  *  TreeLinkNode *left, *right, *next;
     6  *  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
     7  * };
     8  */
     9 class Solution {
    10 public:
    11     void connect(TreeLinkNode *root) {
    12         TreeLinkNode *cur = root;
    13         TreeLinkNode *layer_first = root;
    14         
    15         if (!root)
    16             return;
    17         
    18         while (layer_first->left) {
    19             cur->left->next = cur->right;
    20             if (cur->next) {
    21                 cur->right->next = cur->next->left;
    22                 cur = cur->next;
    23             } else {
    24                 layer_first = layer_first->left;
    25                 cur = layer_first;
    26             }
    27         }
    28         
    29         return;
    30     }
    31 };
  • 相关阅读:
    浅谈VUE中的深拷贝与浅拷贝Object.assign()方法
    echarts详细
    实现HTML调用打开本地软件文件
    el-select 中放置el-tree
    关于前端平时需要用到的方法(未完成)
    10个Vue开发技巧助力成为更好的工程师
    element ui 弹出组件的遮罩层以及多层遮罩解决办法。。
    vue样式穿透 v-deep与deep的具体使用
    # Ansible安装指南
    Linux笔记—网络管理
  • 原文地址:https://www.cnblogs.com/huxiao-tee/p/4516126.html
Copyright © 2011-2022 走看看