-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryTree.java
More file actions
125 lines (112 loc) · 3.22 KB
/
BinaryTree.java
File metadata and controls
125 lines (112 loc) · 3.22 KB
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
import java.util.*;
class BinaryTree{
static class Node{
int data;
Node left;
Node right;
Node(int data){
this.data=data;
this.left=null;
this.right=null;
}
}
static class BuildTree{
static int t=-1;
static Node build(int nodes[]){
t++;
if(nodes[t]==-1){
return null;
}
Node newNode=new Node(nodes[t]);
newNode.left=build(nodes);
newNode.right=build(nodes);
return newNode;
}
}
public static void preorder(Node root){
if(root==null)
return;
System.out.print(root.data+" ");
preorder(root.left);
preorder(root.right);
}
public static void inorder(Node root){
if(root==null)
return;
inorder(root.left);
System.out.print(root.data+" ");
inorder(root.right);
}
public static void postorder(Node root){
if(root==null)
return;
postorder(root.left);
postorder(root.right);
System.out.print(root.data+" ");
}
public static void levelorder(Node root){
if(root==null){
return;
}
Queue <Node> q=new LinkedList<>();
q.add(root);
q.add(null);
while(!q.isEmpty()){
Node curr=q.remove();
if(curr==null){
System.out.println();
if(q.isEmpty()){
break;
}
else{
q.add(null);
}
}
else{
System.out.print(curr.data+" ");
if(curr.left!=null)
q.add(curr.left);
if(curr.right!=null)
q.add(curr.right);
}
}
}
public static int count(Node root){
if(root==null)
return 0;
int left=count(root.left);
int right=count(root.right);
return left+right+1;
}
public static int Sum_of_nodes(Node root){
if(root==null)
return 0;
int left=Sum_of_nodes(root.left);
int right=Sum_of_nodes(root.right);
return left+right+root.data;
}
public static int height(Node root){
if(root==null)
return 0;
int left=height(root.left);
int right=height(root.right);
int res=Math.max(left,right);
return res+1;
}
public static void main(String args[]){
int nodes[]={1, 2, 4, -1, -1, 5, -1, -1, 3, -1, 6, -1, -1};
BuildTree bt=new BuildTree();
Node root=bt.build(nodes);
/*System.out.println(root.data);
preorder(root);
System.out.println();
inorder(root);
System.out.println();
postorder(root);
levelorder(root);
*/
System.out.println("Number of nodes present is:"+count(root));
System.out.println("Sum of the data present in nodes present is:"+ Sum_of_nodes(root));
System.out.println("Height of tree is:"+height(root));
}
}