kotlin-coding-challenges

Binary search tree

Instructions

Implement binary search tree (BST).

Challenge

Solution

Examples

//----------Tree------------
//
//           6
//         /   \
//        3     8
//       /
//      1   
//
//--------------------------

val bst = BinarySearchTree<Int>()
bst.add(6)
bst.add(3)
bst.add(1)
bst.add(8)

This site is open source. Improve this page.