Tree data structure as a MATLAB class
Updated 29 Nov 2022
A tree is a hierarchical data structure where every node has exactly one parent (expect the root) and no or several children.
Along with this relational structure, each node can store any kind of data.
This class implements it using plain MATLAB syntax and arrays. Most useful methods are implemented, using overloading of MATLAB functions for tree objects.
For instance you can type:
>> find ( (a.^2 .* b) > (c - 5) & d )
with a, b, c and d being tree objects.
Very handy, trivial to use. A rather long tutorial is included to walk you through trees, and show how to make the best out of them.
The tutorial can be found here:
Jean-Yves Tinevez (2023). Tree data structure as a MATLAB class (https://github.com/tinevez/matlab-tree), GitHub. Retrieved .
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Versions that use the GitHub default branch cannot be downloaded
- Move to gihub
Put back the thumbnail.
- Iteration, plotting and string conversion can be done by forcing the children to be iterated in alphabetical (or any) order.
Fixed a severe bug in the chop method, noticed by Francisco Marquez Gutierrez (thanks!).