public static Node treeSearch(Node root, int key){
		if(root == null || key == root.key){
			return root;
		}
		if(key < root.key)
			return treeSearch(root.left,key);
		else
			return treeSearch(root.right,key);
	}