Binary search tree

Inspiration- A binary search tree follows some order to arrange the elements. In a Binary search tree, the value of left node must be smaller than the parent node, and the value of right node must be greater than the parent node. This rule is applied recursively to the left and right subtrees of the root.

What it does - Construct BST

How we built it - we build it from Postorder

Challenges we ran into - indexing , error in traversal etc

Accomplishments that we're proud of - successfully created binary search tree

What we learned - how to build a binary search tree

What's next for Binary search tree - improving our code to reduce time complexity

Built With

• python
• sublime-text