File size: 1,962 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 |
import java.util.*;
class BT{
Node root;
static class Node{
int data;
Node left;
Node right;
Node(int d){
data = d;
left = null;
right = null;
}
}
void create(){
Node t;
Node p;
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 preOr(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 Inor(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 Height(Node n){
int x=0,y=0;
if(n==null){
return 0;
}
x = Height(n.left);
y = Height(n.right);
if(x>y){
return((x+1));
}
else{
return((y+1));
}
}
int N(Node n){
if(n!=null){
return N(n.left)+N(n.right)+1;
}
return 0;
}
public static void main(String[] args){
BT l = new BT();
l.create();
l.preOr(l.root);
System.out.println("\n");
l.Inor(l.root);
System.out.println(" "+l.Height(l.root));
System.out.println(" "+l.N(l.root));
}
}
|