zoukankan      html  css  js  c++  java
  • 116. Populating Next Right Pointers in Each Node (Tree; WFS)

    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指针,我们只需记录每层最左的节点,所以可以做到use constant extra space

    class Solution {
    public:
      void connect (TreeLinkNode *root){
        TreeLinkNode* parent;
        TreeLinkNode* current;
        TreeLinkNode* nextParent = root;
        while(nextParent){ //new level started
           parent = nextParent;
           nextParent = parent->left;
           current = nextParent;
           if(!current) return;
       
           //add next pointer
           current->next = parent->right;
           current = current->next;
           if(!current) return;
           while(parent->next){
              parent = parent->next;
              current->next = parent->left;
              current = current->next;
              if(!current) return;
              current->next = parent->right;
              current = current->next;
              if(!current) return;
           }
        }
      }
    };
  • 相关阅读:
    Servlet Filter过滤器执行顺序
    eclipse乱码问题
    如何查看servlet&jsp版本?
    Unity的shader学习2
    Unity的shader学习1
    后缀数组专题与代码模板
    哈希表/散列表 指针版模版
    图的连通性专题及模板
    一般图最大匹配--带花树
    7-15至7-17训练赛回顾
  • 原文地址:https://www.cnblogs.com/qionglouyuyu/p/4854556.html
Copyright © 2011-2022 走看看