Can pointers be considered an efficient and semantic-wise data structure? How can it stackup against linked list, hash, queus, stack?
Can pointers be considered an efficient and semantic-wise data structure? How can it stackup
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.
Can pointers be considered an efficient and semantic-wise data structure? How can it stackup against linked list, hash, queus, stack?
No, a pointer is just a type, not a structure. There are implementations of structures that are types (
std::vector,std::map, …), but a pointer is not.They are commonly used internally in the implementations of the structures you enumerated, but in itself, a pointer is not a structure.