Data structures using C or C ++?

Question

What are the benefits of using C ++ based classes / objects using legacy C structures to manage standard data structures like Linked List, Stack, Tree, Queue..etc? Let me know if the question is not clear.

Answer 1

On the one hand, in C ++ you can use templates that allow you to create shared collections and use them in a safe manner. That is, you can have a list of strings, another int list and a third of objects YourClass, all backed up by a single list implementation, and the compiler ensures that you cannot put a string in an int list.

In C, you could only achieve this with pointers void*, and the type of security was not guaranteed by the compiler.

Answer 2

One of the benefits is that it provides performance guarantees. In addition, the code is easier to maintain because it is standardized, and any new member joining the team will be able to quickly understand the code.

Answer 3

++/OO:

, .

/, : . push() pop(), .

.

- .

Answer 4

, () .

c style:

linkedlist_append(linkedlist* list, void* element)

:

class LinkedList
{
   LinkedList* Append(void* element);
}

   LinkedList* Append(T* element);

Answer 5

++ STL ( OP). std:: map ++. C . , STL , , , . , ++ , STL , , .

, ++ , . C.

Answer 6

, C, , ++ . ++ . datastructures, , add() , , find(). , - . , , , ( ) , , .

, ++ , , , , , .

Answer 7

, , , . , . - , - . if , , .