117. Populating Next Right Pointers In Each NodeII

jackwang 發布于2019-08-14 14:13 / 615人閱讀

題目：
Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

You may only use constant extra space.
For example,
Given the following binary tree,

After calling your function, the tree should look like:

     1 -> NULL
   /  
  2 -> 3 -> NULL
 /     
4-> 5 -> 7 -> NULL

解答：

public class Solution {
    public void connect(TreeLinkNode root) {
        //重點是記錄current, head, prev這三個結點
        TreeLinkNode curt = root;
        TreeLinkNode head = null;
        TreeLinkNode prev = null;
        
        while (curt != null) {
            while (curt != null) {
                if (curt.left != null) {
                    if (prev != null) {
                        prev.next = curt.left;
                    } else {
                        head = curt.left;
                    }
                    prev = curt.left;
                }
                if (curt.right != null) {
                    if (prev != null) {
                        prev.next = curt.right;
                    } else {
                        head = curt.right;
                    }
                    prev = curt.right;
                }
                curt = curt.next;
            }
            curt = head;
            head = null;
            prev = null;
        }
    }
}

GPU云服務器云服務器 NodeII Populating cdn117 Pointers

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/64883.html

leetcode116-117. Populating Next Right Pointers in

摘要：題目要求給一個完全二叉樹，將當前節點的值指向其右邊的節點。而在中則是提供了一個不完全的二叉樹，其它需求沒有發生改變。我們需要使用一個變量來存儲父節點，再使用一個變量來存儲當前操作行的，將前一個指針指向當前父節點的子節點。題目要求 Given a binary tree struct TreeLinkNode { TreeLinkNode *left; ...

coolpail 2019-08-15 11:07 評論0 收藏0
[Leetcode] Populating Next Right Pointers in Each

摘要：原題鏈接廣度優先搜索復雜度時間空間思路相當于是遍歷二叉樹。代碼記錄本層節點的個數最后一個節點的是，不做處理遞歸法復雜度時間空間遞歸棧空間思路由于父節點多了指針，我們不用記錄父節點的父節點就能直到它相鄰的節點。 Populating Next Right Pointers in Each Node I Given a binary tree struct TreeLinkNode { ...

miracledan 2019-08-14 16:10 評論0 收藏0
LeetCode[117] Population Next Right Pointers in Ea

摘要：復雜度思路設置一個指向下一層要遍歷的節點的開頭的位置。 LeetCode[117] Population Next Right Pointers in Each Node II 1 / 2 3 / 4 5 7 After calling your function, the tree should look like: ...

lijinke666 2019-08-14 15:06 評論0 收藏0
[LeetCode] 426. Convert BST to Sorted Doubly Linke

Problem Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list. Lets take the foll...

MartinDai 2019-08-16 13:28 評論0 收藏0
Life of a Pixel 2018

摘要：將操作記錄為一列。在列表上進行操作被稱為光柵化。能夠運行產生位圖的命令加速光柵化注意到此時像素并不在屏幕上。因此，線程將劃分為。根據與的距離確定的優先級。被包裝在一個中，該對象被提交給瀏覽器進程。 This talk is about how Chrome turns web content into pixels. The entire process is called rend...

Miracle 2019-08-23 11:53 評論0 收藏0