-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
222.java
61 lines (59 loc) · 1.72 KB
/
222.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
52
53
54
55
56
57
58
59
60
61
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int countNodes(TreeNode root) {
if (root == null)
return 0;
return countNodes(root.left) + countNodes(root.right) + 1;
}
}
__________________________________________________________________________________________________
sample 36656 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int GetTreeHeight(TreeNode node)
{
if(node == null) return 0;
int leftH = GetTreeHeight(node.left);
return 1 + leftH;
}
public int CountTreeLeave(TreeNode node,int height, int curHeight)
{
if(node == null) return 0;
if(node.left == null && node.right == null)
{
if(curHeight == height) return 1;
else return 0;
}
else
{
return CountTreeLeave(node.left, height, curHeight+1) + CountTreeLeave(node.right, height, curHeight+1);
}
}
public int countNodes(TreeNode root)
{
if(root == null) return 0;
int height = GetTreeHeight(root);
int countLeave = CountTreeLeave(root, height,1);
int nodeNum = (int) Math.pow(2, height-1)-1;
return nodeNum+countLeave;
}
}
__________________________________________________________________________________________________