What exactly is the point of having a key-value pair in a binary search tree? Can someone give an example of one such instance? Because in the stl set container, I don’t explicitly assign a key-value pair.
I’m new to BSTs.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What exactly is the point of having a key-value pair in a binary search tree? Can someone give an example of one such instance? Because in the stl set container, I don’t explicitly assign a key-value pair.
I’m new to BSTs.
A key could be a simple value used to insert, find or delete a node from the tree. Value could be the data a node holds. For example, a key can be username while value can be user information like Name, surname, age, location, preferences …