Populating Next Right Pointers in Each Node

最新推荐文章于 2022-02-28 18:16:11 发布

原创最新推荐文章于 2022-02-28 18:16:11 发布 · 146 阅读

0 ·

CC 4.0 BY-SA版权

leetCode Solutions 专栏收录该内容

53 篇文章

订阅专栏

本文深入探讨了树连接算法的实现细节，通过实例演示如何优化树结构的连接操作。

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void connect(TreeLinkNode root) {
        if (root == null) return;
        TreeLinkNode levelStart = root;
        TreeLinkNode levelRun = null;
        while(levelStart.left != null){
            levelRun = levelStart;
            while(levelRun != null){
                levelRun.left.next = levelRun.right;
                if (levelRun.next != null){
                    levelRun.right.next = levelRun.next.left;
                }
                levelRun = levelRun.next;
            }
            levelStart = levelStart.left;
        }
    }
}