0 added
0 removed
Original
2026-01-01
Modified
2026-02-21
1
<p>A tree is one of the widespread data structures in computer science and a natural way to model certain subject areas. Everyone will encounter trees as a data structure in one form or another, even if they're not into computers or programming in general. The most obvious example is a family tree, and if we're looking for something more up our street, a file tree.</p>
1
<p>A tree is one of the widespread data structures in computer science and a natural way to model certain subject areas. Everyone will encounter trees as a data structure in one form or another, even if they're not into computers or programming in general. The most obvious example is a family tree, and if we're looking for something more up our street, a file tree.</p>
2
<p>HTML, JSON, XML, and many others have a tree-like structure. Comments and product catalogs on websites can also be tree-like. Any hierarchy is a tree by its definition.</p>
2
<p>HTML, JSON, XML, and many others have a tree-like structure. Comments and product catalogs on websites can also be tree-like. Any hierarchy is a tree by its definition.</p>
3
<p>There is one curious aspect associated with trees. The level of understanding of trees and the ability to work with them correlates with the developer's skills. If it's easy for a developer to work with trees, then they'll be able to understand code quite well. Otherwise, they'll have more difficulties with writing and analyzing code.</p>
3
<p>There is one curious aspect associated with trees. The level of understanding of trees and the ability to work with them correlates with the developer's skills. If it's easy for a developer to work with trees, then they'll be able to understand code quite well. Otherwise, they'll have more difficulties with writing and analyzing code.</p>
4
<p>In this course, there'll be no new syntax or any programming elements that you haven't studied in Hexlet before this course. However, the topic of trees is more complicated than other topics due to the recursive nature of the trees themselves. We should switch our brains onto trees - this is most likely the most challenging part. It is something that you can't just learn by reading the theory. Only practice and experimenting can help with this.</p>
4
<p>In this course, there'll be no new syntax or any programming elements that you haven't studied in Hexlet before this course. However, the topic of trees is more complicated than other topics due to the recursive nature of the trees themselves. We should switch our brains onto trees - this is most likely the most challenging part. It is something that you can't just learn by reading the theory. Only practice and experimenting can help with this.</p>
5
<p>We want to simplify the understanding and memorizing, so our recommendations are the same:</p>
5
<p>We want to simplify the understanding and memorizing, so our recommendations are the same:</p>
6
<ol><li>Be sure to repeat all the code given in theory locally on your computer</li>
6
<ol><li>Be sure to repeat all the code given in theory locally on your computer</li>
7
<li>Don't forget to print as much as possible to help you debug</li>
7
<li>Don't forget to print as much as possible to help you debug</li>
8
<li>Display all data changes while the code is running</li>
8
<li>Display all data changes while the code is running</li>
9
</ol><p>In this short course, we'll dive into the topic of trees and learn how to work with them. What won't be in this course is algorithms in the same way as you might see at university. This course has completely different goals. It teaches working with recursive data structures through tree recursion.</p>
9
</ol><p>In this short course, we'll dive into the topic of trees and learn how to work with them. What won't be in this course is algorithms in the same way as you might see at university. This course has completely different goals. It teaches working with recursive data structures through tree recursion.</p>