Set Data Structure And Operations | C Programming Example

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

We can implement a delete set function to delete sets from memory like this:

void delete_set(Set *set)
{
free(set->members);
free(set);
}

This will prevent memory leaks from occurring, so we should use this function when we are done with sets. 🙂

PortfolioCourses
Автор

This is by far my favourite tutorial series on Youtube :D

ecro
Автор

should we free up the allocated memory on some where?
I used this set in leetcode problem, their last input was 1 00 000 numbers and got memory limit ex. error

omnimathic
Автор

similar to the insert function how would you create the corresponding delete function or remove function?

DevilshadowCOD
Автор

Thank you so much for this! I love your videos, you explain them so well. I was wondering if you offer online 1-on-1 tutoring?

MyName-bwkz
Автор

first, thank you very much for taking the time in making this tutorial. I have been looking how a set efficiently checks whether there is an element. Am I correct to assume a set basically checks linearly if there is an element? With an ordered set, which way would you recommend ordering a new entry? cheers and thank you

MadpolygonDEV
Автор

Sir, Could you upload the full course of data structures and algorithms, please?

abdulazizrakhimov