Skip to content

Latest commit

 

History

History
20 lines (14 loc) · 308 Bytes

File metadata and controls

20 lines (14 loc) · 308 Bytes

Binary Search Tree

This solution contains a BST implementation that can add and remove elements from a tree; all functions run in O(log(n)) time.

How To Run

javac BST.java
java BST

Input

Input is accepted in the following format:

csv_of_elements | element_to_delete
1,2,3,4 | 3