[Template] Binary Index Tree

import java.util.Scanner; public class BinaryIndexedTreeTemplate { private static int[] tree; public static void main(String[] args) { ...

[Template] Segment Tree

import java.util.Scanner; class Tree { int left; int right; int count; //Stand for what you want to record Tree(int l, int r) { ...

[Template] Binary Search Tree (BST)

Search while(low <= high){ int mid = low+((high-low)/2); int value = nums[mid]; if(value == target){ return mid; }els...