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.
I want to create binary search tree data structure in C/C++ where each node holds some data (objects or pointers). I will access this tree in multi-threading environment, If I can guarantee that each thread will access (read) different subtrees/paths/nodes of the tree, than it is thread-safe to modify objects (or data pointers point to) stored in nodes and so I can avoid locking?
Locking is not the goal, providing exclusive access to a resources is. Locking is a means of achieving that goal. You’ve stated you can achieve that goal by some other means. Using this other means would be as thread-safe as using locks would be.