File size: 1,973 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 |
import java.util.*;
class Tree{
static Node root;
static class Node{
int data;
Node left;
Node right;
Node(int d){
data = d;
this.left = null;
this.right = null;
}
}
void create(){
int x;
Node p,t;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the root value");
x = sc.nextInt();
Queue<Node> q = new LinkedList<Node>();
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 Preorder(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 Inorder(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;
}
}
}
void PostOrder(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();
n = n.right;
System.out.println(n.data+" ");
}
}
}
public static void main(String[] args){
Tree l = new Tree();
l.create();
l.Preorder(l.root);
System.out.println("\n");
l.Inorder(l.root);
System.out.println("\n");
// l.PostOrder(l.root);
}
}
|