-
Notifications
You must be signed in to change notification settings - Fork 147
/
NextTreeNode58.java
51 lines (47 loc) · 1.13 KB
/
NextTreeNode58.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package com.so;
/**
* 第58题
* 给定一个二叉树的某个结点,请找出中序遍历顺序的下一个结点并且返回
*
* @author qgl
* @date 2017/08/30
*/
public class NextTreeNode58 {
/**
* 二叉树
*/
static class TreeLinkNode {
int val;
TreeLinkNode left = null;
TreeLinkNode right = null;
TreeLinkNode next = null;
TreeLinkNode(int val) {
this.val = val;
}
}
/**
* 获取输入节点的下一个节点
*
* @param pNode
* @return
*/
public static TreeLinkNode getTreeLinkNextNode(TreeLinkNode pNode) {
if (pNode == null) {
return null;
}
if (pNode.right != null) {
pNode = pNode.right;
while (pNode.left != null) {
pNode = pNode.left;
}
return pNode;
}
while (pNode.next != null) {
// 找第一个当前节点是父节点左孩子的节点
if (pNode.next.left == pNode)
return pNode.next;
pNode = pNode.next;
}
return null;
}
}