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
47 lines (35 loc) · 826 Bytes

File metadata and controls

47 lines (35 loc) · 826 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
42
43
44
45
46
47
/**
* 剑指Offer,二叉搜索树的第K个节点
*/
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public class BinaryTreeKthSmallNodeSolution {
int index = 0;
TreeNode resultNode = null;
TreeNode KthNode(TreeNode pRoot, int k)
{
if (pRoot == null || k <= 0) {
return null;
}
findKthSamll(pRoot, k);
return resultNode;
}
public void findKthSamll(TreeNode node, int k) {
if (node.left != null) {
findKthSamll(node.left, k);
}
index++;
if (index == k) {
resultNode = node;
}
if(node.right != null) {
findKthSamll(node.right, k);
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.