zoukankan      html  css  js  c++  java
  • [LeetCode#]Populating Next Right Pointers in Each Node

    The problem:

    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

    First solution : <O(n) space complexity>

    public class Solution {
        public void connect(TreeLinkNode root) {
            if (root == null)
                return;
            Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode> ();
            TreeLinkNode cur_node;
            int cur_num = 1;
            int next_num = 0;
            queue.offer(root);
            
            while (queue.size() != 0) {
                cur_node = queue.poll();
                cur_num--;
                if (cur_node.left != null) {
                    queue.offer(cur_node.left);
                    next_num++;
                }
                if (cur_node.right != null) {
                    queue.offer(cur_node.right);
                    next_num++;
                }
                if (cur_num != 0) {
                    cur_node.next = queue.peek();
                } else{
                    cur_node.next = null;
                    cur_num = next_num;
                    next_num = 0;
                }
            }
        }
    }
  • 相关阅读:
    emacs 集成astyle
    git reflog
    rpm 打包的时候 不进行strip
    gmock
    如何对正在运行的进程,进行heap profile
    linux性能压测工具
    默认宏定义
    gdb fabs错误输出
    基于Clang的缓存型C++编译器Zapcc
    grep 多行 正则匹配
  • 原文地址:https://www.cnblogs.com/airwindow/p/4235825.html
Copyright © 2011-2022 走看看