public static void main(String args[]){
        ConstructTreeFromInOrderPreOrder ctf = new ConstructTreeFromInOrderPreOrder();
        int inorder[] = {4,10,6,46,11,13,2};
        int preorder[] = {46,10,4,6,13,11,2};
        Node root = ctf.createTree(inorder, preorder);
        SumTree st = new SumTree();
        System.out.println(st.isSumTree(root));
    }
http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-sumtree/
A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes present 
in its left subtree and right subtree
src/com/interview/tree/SumTree.java