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;
            }
        }
    };
  • 相关阅读:
    linux scull 函数open 方法
    linux scull 中的设备注册
    linux 字符设备注册
    linux inode 结构
    linux设备驱动文件结构
    linux一些重要数据结构
    Python3.2官方文档翻译--输出格式化
    1021. Deepest Root (25)
    hdu 4779 Tower Defense (思维+组合数学)
    cookie是什么? -- web
  • 原文地址:https://www.cnblogs.com/vercont/p/10210257.html
Copyright © 2011-2022 走看看