Freeing (or deallocating) a Binary Tree in C

Source code can be found here:
code-vault.net...
===== Support us through our store =====
code-vault.net...
===== Check out our website =====
code-vault.net
===== Check out our Discord server =====
discord.code-v...

[@vilijanac]

I know all this, hence not given job so moved to Perl language.

[@CodeVault]

I can only respect people that work in Perl. It seems like such a strange language

[@playingnumber]

Please make a video on valgrid

[@CodeVault]

I will add it to my list. Thanks for the feedback!

[@CedLePingouin]

Regarding the situation explained at 3:39, is it really necessary to iterate over the queue (array) backwards, since we iterate over that array at the end of our function, and the array already contains all the "nodes", which are essentially pointers ? Since free() only needs an address/pointer in order to deallocate the memory/object associated with it, and we have all of them in that array (meaning we didn't lose any references/adresses to the nodes in the process), does the order in which we free all pointers really matter ?

[@CodeVault]

Oh, you are actually right about that. EIther direction of iteration works in that case as long as you always iterate over the whole array

[@DanielMartensson-x3l]

Can you show how to use GTK+ in C or OpenGL in C :)

[@CodeVault]

I'll look into it

[@DanielMartensson-x3l]

@@CodeVault You have a high skill in memory management. One option is to connect that knowledge to real short projects such as 3D rendering or GUI development because then memory management will come in handy. :)

[@CodeVault]

As a matter of fact I have already created my own "game engine" in C around 6 years ago. It's a basic clone of the game Minecraft, but only has some of the basics implemented there. It's not really finished. I was thinking of making a series where I try to port it to Rust and see how that goes