This study is containing data structure's Binary Search Tree topic with illustration and implementation . Project is implemented in Java. I implement in my university life.
An important application of binary trees is to use them in search operations. The binary search tree is a binary tree in which each parent node contains a data value that provides the following:
- all data values in the left subnet are smaller than the data value in the parent node
- The data value in the parent node is smaller than all values in the right subnet.
- the left and right sub trees are also binary search trees.
(Installation instructions are for the microsoft operating system.)
To install Java with below link. https://www.java.com/tr/download/
To install jre with below link. http://www.oracle.com/technetwork/java/javase/downloads/jre8-downloads-2133155.html
To install jdk with below link. http://www.oracle.com/technetwork/java/javase/downloads/index.html
To install NetBeans IDE with below link. https://netbeans.org/downloads/
LinkedIn: https://www.linkedin.com/in/ömer-ulutaş-425a4111a
E-mail: omer1ulutas.g@gmail.com