Inspiration
Data Structure and Algorithms
What it does
Binary search tree A binary search tree is a rooted binary tree in which the nodes are arranged in total order in which the nodes with keys greater than any particular node is stored on the right sub-trees and the ones with equal to or less than are stored on the left sub-tree satisfying the binary search property.
How we built it
Using the knowledge of DSA
What we learned
WE HAVE USED 4 DIFFERENT LANGUAGES TO MAKE IT
- C++
- Java
- Python
- C
Log in or sign up for Devpost to join the conversation.