|
1 | 1 | package com.company;
|
2 | 2 |
|
3 | 3 | class BST {
|
4 |
| - class Node{ |
| 4 | + class Node { |
5 | 5 | int data;
|
6 | 6 | Node left;
|
7 | 7 | Node right;
|
8 |
| - Node(){ |
| 8 | + |
| 9 | + Node () { |
9 | 10 | }
|
10 |
| - Node(int data){ |
11 |
| - this.data=data; |
12 |
| - this.left=this.right=null; |
| 11 | + |
| 12 | + Node (int data) { |
| 13 | + this.data = data; |
| 14 | + this.left = this.right = null; |
13 | 15 | }
|
14 | 16 | }
|
15 | 17 |
|
16 | 18 | Node root;
|
17 | 19 |
|
18 |
| - void insert(int data){ |
19 |
| - root=insertRec(root,data); |
| 20 | + void insert (int data) { |
| 21 | + root = insertRec(root, data); |
20 | 22 | }
|
21 |
| - private Node insertRec(Node root,int data){ |
22 |
| - if(root==null){ |
23 |
| - root=new Node(data); |
| 23 | + |
| 24 | + private Node insertRec (Node root, int data) { |
| 25 | + if (root == null) { |
| 26 | + root = new Node(data); |
24 | 27 | return root;
|
25 |
| - }else{ |
26 |
| - if(data<root.data){ |
27 |
| - root.left=insertRec(root.left,data); |
28 |
| - }else if(data>root.data){ |
29 |
| - root.right=insertRec(root.right,data); |
| 28 | + } else { |
| 29 | + if (data < root.data) { |
| 30 | + root.left = insertRec(root.left, data); |
| 31 | + } else if (data > root.data) { |
| 32 | + root.right = insertRec(root.right, data); |
30 | 33 | }
|
31 | 34 | }
|
32 | 35 | return root;
|
33 | 36 | }
|
34 | 37 |
|
35 |
| - void inorder(){ |
| 38 | + void inorder () { |
36 | 39 | inorderRec(root);
|
37 | 40 | System.out.println();
|
38 | 41 | }
|
39 |
| - private void inorderRec(Node root){ |
40 |
| - if(root!=null){ |
| 42 | + |
| 43 | + private void inorderRec (Node root) { |
| 44 | + if (root != null) { |
41 | 45 | inorderRec(root.left);
|
42 |
| - System.out.print(root.data+" "); |
| 46 | + System.out.print(root.data + " "); |
43 | 47 | inorderRec(root.right);
|
44 | 48 | }
|
45 | 49 | }
|
46 | 50 |
|
47 |
| - void preorder(){ |
| 51 | + void preorder () { |
48 | 52 | preorderRec(root);
|
| 53 | + System.out.println(); |
49 | 54 | }
|
50 |
| - private void preorderRec(Node root){ |
51 |
| - if(root!=null){ |
52 |
| - System.out.print(root.data+" "); |
| 55 | + |
| 56 | + private void preorderRec (Node root) { |
| 57 | + if (root != null) { |
| 58 | + System.out.print(root.data + " "); |
53 | 59 | preorderRec(root.left);
|
54 | 60 | preorderRec(root.right);
|
55 | 61 | }
|
56 | 62 | }
|
57 |
| - |
58 |
| - void postorder(){ |
59 |
| - postorderRec(root); |
60 |
| - } |
61 |
| - private void postorderRec(Node root){ |
62 |
| - if(root!=null){ |
63 |
| - postorderRec(root.left); |
64 |
| - postorderRec(root.right); |
65 |
| - System.out.print(root.data+" "); |
66 |
| - } |
67 |
| - } |
68 |
| - |
69 | 63 | }
|
0 commit comments