# Introduction In this lab, we will learn how to implement a Binary Search Tree in Java. A Binary Search Tree is a binary tree data structure in which the value of each node is greater than or equal to the values in its left subtree and less than or equal to the values in its right subtree.
Click the virtual machine below to start practicing