/*
public class TreeLinkNode {
int val;
TreeLinkNode left = null;
TreeLinkNode right = null;
TreeLinkNode next = null;
TreeLinkNode(int val) {
this.val = val;
}
}
*/
public class Solution{
public TreeLinkNode GetNext(TreeLinkNode pNode) {
TreeLinkNode tmp = null;
if (pNode == null) {
return null;
}
// 首先判断当前节点是否是根节点
if (pNode.next == null) {
// 该节点是根节点
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
// 右孩子最左边
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
}
return right;
} else {
return null;
}
} else {
// 当前节点不是根节点
// 判断当前节点是其父亲节点的左子树还是右子树
// 父亲节点的左子树
if (pNode.next.left == pNode) {
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
// 右孩子最左边
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
}
return right;
} else {
return pNode.next;
}
}
// 父亲节点的右子树
if (pNode.next.right == pNode) {
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
} else {
return right;
}
} else {
// 没有右子树
// 判断是在整棵树的左边还是整棵树的右边
TreeLinkNode node = null;
TreeLinkNode mk = pNode;
while (pNode.next != null) {
node = pNode;
pNode = pNode.next;
}
if (pNode.left == node) {
// pNode在整棵树的左边
return mk.next.next;
} else {
return null;
}
}
}
}
return null;
}
}
public class TreeLinkNode {
int val;
TreeLinkNode left = null;
TreeLinkNode right = null;
TreeLinkNode next = null;
TreeLinkNode(int val) {
this.val = val;
}
}
*/
public class Solution{
public TreeLinkNode GetNext(TreeLinkNode pNode) {
TreeLinkNode tmp = null;
if (pNode == null) {
return null;
}
// 首先判断当前节点是否是根节点
if (pNode.next == null) {
// 该节点是根节点
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
// 右孩子最左边
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
}
return right;
} else {
return null;
}
} else {
// 当前节点不是根节点
// 判断当前节点是其父亲节点的左子树还是右子树
// 父亲节点的左子树
if (pNode.next.left == pNode) {
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
// 右孩子最左边
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
}
return right;
} else {
return pNode.next;
}
}
// 父亲节点的右子树
if (pNode.next.right == pNode) {
if (pNode.right != null) {
TreeLinkNode right = pNode.right;
if (right.left != null) {
tmp = right.left;
while (tmp.left != null) {
tmp = tmp.left;
}
return tmp;
} else {
return right;
}
} else {
// 没有右子树
// 判断是在整棵树的左边还是整棵树的右边
TreeLinkNode node = null;
TreeLinkNode mk = pNode;
while (pNode.next != null) {
node = pNode;
pNode = pNode.next;
}
if (pNode.left == node) {
// pNode在整棵树的左边
return mk.next.next;
} else {
return null;
}
}
}
}
return null;
}
}