File size: 2,423 Bytes
c574d3a |
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 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 |
import java.util.*;
class BinaryTree{
static Node root;
static class Node{
int data;
Node left;
Node right;
Node(int d){
this.data = d;
this.left = null;
this.right= null;
}
}
void create(){
Node p, t;
int x;
Scanner sc = new Scanner(System.in);
Queue<Node> q = new LinkedList<>();
System.out.println("Enter the root value");
x = sc.nextInt();
root = new Node(x);
q.add(root);
while(!q.isEmpty()){
p = q.poll();
System.out.println("Enter the left child of "+p.data);
x = sc.nextInt();
if(x!=-1){
t = new Node(x);
p.left = t;
q.add(t);
}
System.out.println("Enter the right child of "+p.data);
x = sc.nextInt();
if(x!=-1){
t = new Node(x);
p.right = t;
q.add(t);
}
}
}
void Pre(Node n){
Stack<Node> st = new Stack<>();
while(n!=null || !st.isEmpty()){
if(n!=null){
System.out.print(n.data+" ");
st.push(n);
n = n.left;
}
else{
n = st.pop();
n = n.right;
}
}
}
void In(Node n){
Stack<Node> st = new Stack<>();
while(n!=null || !st.isEmpty()){
if(n!=null){
st.push(n);
n = n.left;
}
else{
n = st.pop();
System.out.print(n.data+" ");
n = n.right;
}
}
}
int countNode(Node n){
if(n!=null){
return countNode(n.left)+countNode(n.right)+1;
}
return 0;
}
int Height(Node n){
if(n==null){
return 0;
}
int x = Height(n.left);
int y = Height(n.right);
if(x>y){
return x+1;
}
else{
return y+1;
}
}
void Level(Node n){
Queue<Node> q = new LinkedList<>();
System.out.print(n.data+" ");
q.add(n);
while(!q.isEmpty()){
n = q.poll();
if(n.left!=null){
System.out.print(n.left.data+" ");
q.add(n.left);
}
if(n.right!=null){
System.out.print(n.right.data+" ");
q.add(n.right);
}
}
}
public static void main(String[] args){
BinaryTree l = new BinaryTree();
l.create();
l.Level(l.root);
System.out.print("\n");
System.out.println(l.countNode(l.root));
System.out.println("\n");
System.out.println(l.Height(l.root));
}
}
|