If input list is not sorted, the results are undefined. Binary Search tree Java implementation – Insertion, traversal and search node. Split() String method in Java with examples, Object Oriented Programming (OOPs) Concept in Java, https://docs.oracle.com/javase/7/docs/api/java/util/Collections.html#binarySearch(java.util.List,%20T), Java.util.BitSet class methods in Java with Examples | Set 2, Java.util.BitSet class in Java with Examples | Set 1, Java.util.Collections.rotate() Method in Java with Examples, Java.util.Collections.frequency() in Java with Examples, Java.util.Arrays.equals() in Java with Examples, Java.util.Collections.disjoint() Method in java with Examples, Java 8 | Consumer Interface in Java with Examples, Java.util.LinkedList.poll(), pollFirst(), pollLast() with examples in Java, Java 8 | ArrayDeque removeIf() method in Java with Examples, Java lang.Long.lowestOneBit() method in Java with Examples, Java lang.Long.numberOfTrailingZeros() method in Java with Examples, Java lang.Long.numberOfLeadingZeros() method in Java with Examples, Java lang.Long.highestOneBit() method in Java with Examples, Java lang.Long.byteValue() method in Java with Examples, Java lang.Long.reverse() method in Java with Examples, Java lang.Long.builtcount() method in Java with Examples, Java Clock tickMinutes() method in Java with Examples, Java Clock withZone() method in Java with Examples, Java.util.concurrent.RecursiveAction class in Java with Examples, Java 8 | BiConsumer Interface in Java with Examples. Binary Search Tree . java.util.Collections.binarySearch() method is a java.util.Collections class method that returns position of an object in a sorted list. extends T> list, T key, Comparator int binarySearch(List c). binarySearch(List> list, T key) Writing code in comment? Following is the declaration of binarySearch() method: ClassCastException- It throws exception if the elements of the list are not mutually comparable or the search key is not mutually comparable with the elements of the list. extends Comparable * You may assume that you won't get a BST with a different generic type. How does Collections.binarySearch work for LinkedList? All rights reserved. Searching an int key in a list sorted in descending order. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. Searching in a list of user-defined class objects: Arrays.binarysearch() vs Collections.binarySearch() This article is contributed by Mohit Gupta. May 21, 2020 September 16, 2014 by Sumit Jain Binary Tree : A data structure in which we have nodes containing data and two references to other nodes, one on the left and one on the right. The binarySearch() is an inbuilt method of Java Collections class which returns the position of the object in a sorted list. Binary search tree is a special type of binary tree which have following properties. Please mail your requirement at hr@javatpoint.com. Binary Search tree can be defined as a class of binary trees, in which the nodes are arranged in a specific order. JavaTpoint offers college campus training on Core Java, Advance Java, .Net, Android, Hadoop, PHP, Web Technology and Python. How to add an element to an Array in Java? the list in which binary search is to be performed and the element that is to be searched.