June 2018
Intermediate to advanced
316 pages
6h 34m
English
A binary search tree allows you find, add, and remove items quickly. Each node of this data structure has to be comparable. A typical implementation in Java or Kotlin assumes that a class that is used as a key implements the Comparable interface. To find a key, you have to compare the current node's key. If they are equal, then the root node is the result. If a key is greater than a current node's key, you have to move to a right node. Otherwise, you have to move to a left node.
It is built according to these rules:
Read now
Unlock full access