Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
41 lines (35 loc) · 959 Bytes

File metadata and controls

41 lines (35 loc) · 959 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* 剑指Offer,二叉树的下一个结点
*/
class TreeLinkNode {
int val;
TreeLinkNode left = null;
TreeLinkNode right = null;
TreeLinkNode next = null;
TreeLinkNode(int val) {
this.val = val;
}
}
public class BinaryTreeNextNode {
public TreeLinkNode GetNext(TreeLinkNode pNode)
{
if (pNode.right != null) {
TreeLinkNode rightNode = pNode.right;
while (rightNode.left != null) {
rightNode = rightNode.left;
}
return rightNode;
}
if (pNode.next != null && pNode.next.left == pNode) {
return pNode.next;
}
if (pNode.next != null) {
TreeLinkNode parentNode = pNode.next;
while (parentNode.next != null && parentNode.next.right == parentNode) {
parentNode = parentNode.next;
}
return parentNode.next;
}
return null;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.