Hi,
I was just learning C through the C tutorial and as I reached the Binary Trees lesson, I saw all the search functions such as:
in-order right, left, visit. pre-order left, right, visit etc.
And yet there was no description as to what is the difference between the methods or how it works.
Immediately after the exercise requires to use one of the algos and I had to google about it in order to understand what I must do.
I would really appreciate it if you added a more in-depth explanation about each method and how it functions.
Hi, I was just learning C through the C tutorial and as I reached the Binary Trees lesson, I saw all the search functions such as: in-order right, left, visit. pre-order left, right, visit etc.
And yet there was no description as to what is the difference between the methods or how it works. Immediately after the exercise requires to use one of the algos and I had to google about it in order to understand what I must do.
I would really appreciate it if you added a more in-depth explanation about each method and how it functions.