Tree Data structure Implementation

1. 
   
2. class Node {
3. 
   
4. int data;
5. Node left;
6. Node right;
7. 
   
8. Node(int data) {
9. this.data = data;
10. 
    
11. }
12. }
13. 
    
14. public class BaseTree {
15. public static void main(String[] args) {
16. Node root=new Node(1);
17. 
    
18. Node a1=new Node(2);
19. Node a2=new Node(3);
20. Node a3=new Node(4);
21. Node a4=new Node(5);
22. Node a5=new Node(6);
23. Node a6=new Node(7);
24. 
    
25. 
    
26. root.left=a1;
27. root.right=a2;
28. 
    
29. a1.left=a3;
30. a1.right=a4;
31. 
    
32. a2.left=a5;
33. a2.right=a6;
34. 
    
35. 
    
36. System.out.println(height(root)-1);
37. //preOrder(root);
38. //inOrder(root);
39. //postOrder(root);
40. //System.out.println(root.left.right.data);
41. //System.out.println(root.data);
42. //System.out.println(root.left.data);
43. //System.out.println(root.left.left.data);
44. //System.out.println(root.left.right.data);
45. //System.out.println(root.right.left.data);
46. //System.out.println(root.right.right.data);
47. }
48. 
    
49. public static void preOrder(Node root){
50. if(root==null){
51. return;
52. }
53. System.out.println(root.data);
54. preOrder(root.left);// root=root.left;root=root.left.left;
55. preOrder(root.right);
56. }
57. public static void inOrder(Node root){
58. if(root==null){
59. return;
60. }
61. preOrder(root.left);
62. System.out.println(root.data);
63. preOrder(root.right);
64. }
65. public static void postOrder(Node root){
66. if(root==null){
67. return;
68. }
69. preOrder(root.left);
70. preOrder(root.right);
71. System.out.println(root.data);
72. }
73. 
    
74. 
    
75. public static int height(Node root){
76. if(root==null){
77. return 0;
78. }
79. else
80.     {
81.         int lDepth = height(root.left);
82.         int rDepth = height(root.right);
83. 
    
84.         if (lDepth > rDepth)
85.             return (lDepth + 1);
86.          else
87.             return (rDepth + 1);
88.     }
89. }

}