BST

• 

  Code

Inspiration

-> Global Hack Week and MLH

What it does

-> Implementation of classic problem in data structures "Binary Search Tree"

How we built it

-> Following are the steps which tells how i implemented binary search tree :

1. Initialize an empty multiset window.
2. Initialize an empty vector ans.
3. Scan the array from left to right, maintain the multiset window to contain the k elements.
4. Add the maximum element of current window into the vector ans.
5. Return the vector ans.

Challenges we ran into

-> Increasing the speed and efficiency of code

Accomplishments that we're proud of

-> Implemented a time-efficient implementation of binary search tree

What we learned

-> C++

What's next for BST

-> Take random input and evaluate the answer

Built With

• c++