剑指Offer 二叉树的下一个结点

最新推荐文章于 2024-08-19 16:01:20 发布

PeterKuan99

最新推荐文章于 2024-08-19 16:01:20 发布

阅读量89

点赞数 1

文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/dipu3856/article/details/140593036

版权

public class Solution {
    public TreeLinkNode GetNext(TreeLinkNode pNode) {
        if (pNode == null) {
            return null;
        }

        TreeLinkNode pNext = null;
        if (pNode.right != null) {
            TreeLinkNode mRight = pNode.right;
            while (mRight.left != null) {
                mRight = mRight.left;
            }
            pNext = mRight;
        } else if (pNode.next != null) {
            TreeLinkNode current = pNode;
            TreeLinkNode parent = pNode.next;
            while (parent != null && current == parent.right) {
                current = parent;
                parent = parent.next;
            }
            pNext = parent;
        }
        return pNext;
    }
}