Tree data structure as a MATLAB class
A per-value class that implements a generic tree data structure.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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:
http://tinevez.github.io/matlab-tree/
Cite As
Jean-Yves Tinevez (2026). Tree data structure as a MATLAB class (https://github.com/tinevez/matlab-tree), GitHub. Retrieved .
Acknowledgements
Inspired: BiofilmQ
General Information
- Version 1.4.0.0 (30.1 KB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.4.0.0 | - Move to gihub
|
||
| 1.3.0.0 | Put back the thumbnail. |
||
| 1.2.0.0 | - Iteration, plotting and string conversion can be done by forcing the children to be iterated in alphabetical (or any) order.
|
||
| 1.1.0.0 | Fixed a severe bug in the chop method, noticed by Francisco Marquez Gutierrez (thanks!). |
||
| 1.0.0.0 |
