@@ -0,0 +1,801 @@
+package com.freetymekiyan.datastructures;%0A%0Aimport org.junit.After;%0Aimport org.junit.Assert;%0Aimport org.junit.Before;%0Aimport org.junit.Test;%0A%0Apublic class BinaryIndexedTreeTest %7B%0A%0A    private BinaryIndexedTree tree;%0A%0A    @Before%0A    public void setUp() %7B%0A        int%5B%5D arr = %7B2, 1, 1, 3, 2, 3, 4, 5, 6, 7, 8, 9%7D;%0A        tree = new BinaryIndexedTree(arr, arr.length);%0A    %7D%0A%0A    @Test%0A    public void testExamples() %7B%0A        Assert.assertEquals(2, tree.getSum(0));%0A        Assert.assertEquals(3, tree.getSum(1));%0A        Assert.assertEquals(4, tree.getSum(2));%0A        Assert.assertEquals(7, tree.getSum(3));%0A        tree.update(3, 6); // Update BIT for above change in arr%5B%5D%0A        Assert.assertEquals(13, tree.getSum(3));%0A    %7D%0A%0A    @After%0A    public void tearDown() %7B%0A        tree = null;%0A    %7D%0A%0A%7D

move BinaryIndexedTreeTest to test folder