level node bt java

// http://code2begin.blogspot.com
// program to print level of node in a given binary tree

/**
 * Created by MOHIT on 25-05-2018.
 */

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;

import static java.lang.Integer.max;


// node class
class node{
    int data;
    node left;
    node right;

    // function that returns a pointer to new node
    public node(int element){
        this.data = element;
        this.left = null;
        this.right = null;

    }
};


public class BinaryTree {

    static int level_of_node(node root, int data){
        return level_of_node_helper(root, data, -1);
    }


    public static void main(String arg[]) {
        node head = new node(1);
        head.left = new node(2);
        head.right = new node(3);
        head.left.left = new node(4);
        head.left.right = new node(5);
        head.right.right = new node(6);
        head.left.left.right = new node(7);
        head.right.right.left = new node(8);
        head.left.left.right.left = new node(9);
        head.left.left.right.left.left = new node(10);
        head.right.right.left.right = new node(11);

        System.out.println("Level of node 1 is : " + level_of_node(head, 1));
        System.out.println("Level of node 5 is : " + level_of_node(head, 5));
        System.out.println("Level of node 10 is : " + level_of_node(head, 10));
        System.out.println("Level of node 7 is : " + level_of_node(head, 7));
        System.out.println("Level of node 24 is : " + level_of_node(head, 24));

         System.out.print("All the paths from root to the leaf nodes are : ");
        vector<int> s;
        all_paths_from_root_to_leaf(head,s);
        System.out.print("leaf nodes of the given tree are : ");
        print_leaves(head);

        System.out.print("Diameter of the Above binary tree is : " + diameter(head);




        System.out.print("Boundary traversal of the binary tree is : ");
        boundary_traversal(head);
        return 0;

        */
    }
}