Discussing the article: "From Basic to Intermediate: Queues, Lists, and Trees (VII)"
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
Check out the new article: From Basic to Intermediate: Queues, Lists, and Trees (VII).
Although many people probably don't use trees all that extensively, understanding the mechanisms underlying the implementation of this data structure will allow you to make more effective use of MQL5's capabilities. Remember that the main purpose here is educational. Therefore, each principle you choose should be adapted to your needs and the specific circumstances of each individual case. Although, in theory, everything implemented and demonstrated here may seem applicable to any situation, it will not necessarily be the best solution for your specific task. In that case, a clear understanding of the concepts presented and explained in the articles will help you find the best solution for your situation.
All right, based on this principle, we need to understand how to perform another type of operation on a tree. Although you probably won't use this implementation very often, understanding how it works can help you solve other problems as well. In this article, we will first focus on deleting nodes from a binary tree.
If you think this is a simple task, you're right. However, if you don't understand certain concepts, this task—which, in my opinion, is relatively simple and easy to implement—could turn into a real headache, my dear reader. Especially if you're just starting to learn programming. Without further ado, let's move on to the main topic of this article.
Author: CODE X