zoukankan      html  css  js  c++  java
  • populating-next-right-pointers-in-each-node leetcode C++

    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 toNULL.

    Initially, all next pointers are set toNULL.

    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

    C++

    /**
     * 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){
                TreeLinkNode L(-1);
                TreeLinkNode *f;
                TreeLinkNode *p;
                f = &L;
                p = root;
                while(p){
                    if(p->left != NULL){
                        f->next = p->left;
                        f = f->next;
                    }
                    if(p->right != NULL){
                        f->next = p->right;
                        f = f->next;
                    }
                    p = p->next;
                }
                root = L.next;
            }
        }
    };
  • 相关阅读:
    require() 源码解读
    那些JS容易忽略的题
    javascript:void(0);与return false
    location.href
    IE CSS Bugs 列表和解决方法
    npm 常用命令
    移动开发不能不知道的事-meta
    Canvas介绍
    用CSS变形创建圆形导航
    一个传统行业互联网系统的架构演化(Week 4)
  • 原文地址:https://www.cnblogs.com/vercont/p/10210257.html
Copyright © 2011-2022 走看看