java代码实现二叉查找

@Test
	public void binary() {
		int arr[] = { 1, 3, 6, 9, 9, 10, 18, 19, 20, 23, 100, 200 };
		int start = 0;
		int end = arr.length - 1;
		int middle = end >> 1;
		List<Integer> list = new ArrayList<Integer>();
		int search = 9;
		while (true) {
			//位运算右移以为代表除以2，向下取整
			middle = (end + start) >> 1;
			if (arr[middle] > search) {
				//中间值大于查找值，则改变查找的末尾值end当前中间值-1
				end = middle - 1;
			} else if (arr[middle] < search) {
				//中间值小于查找值，则改变查找的起始值start位当前中间值+1
				start = middle + 1;
			} else {
				//相等即查找到
				list.add(middle);
				//以下为处理查找数据中存在重复数据，进行前后遍历
				if (arr[middle + 1] == search) {
					for (int i = middle + 1; i < arr.length; i++) {
						if (arr[i] == search) {
							list.add(i);
						}
					}
				} else if (arr[middle + 1] == search) {
					for (int i = middle -1; i > 0; i--){
						if (arr[i] == search) {
							list.add(i);
						}
					}
				}
				break;
			}
		}
		for (int i = 0; i < list.size(); i++) {
			System.out.println("查到searchValue，位于数组的第" + list.get(i) + "位(位置从0开始)");
		}
	}