From 14b94865b768c6cdb6634ffe994d9167df42f97b Mon Sep 17 00:00:00 2001 From: Patrick Pelissier Date: Thu, 28 Jul 2022 23:25:57 +0200 Subject: [PATCH] Starting document tree. --- README.md | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/README.md b/README.md index 80b106b2..179180f2 100644 --- a/README.md +++ b/README.md @@ -100,6 +100,7 @@ The following headers define containers that don't require the user structure to * [m-dict.h](#m-dict): header for creating generic dictionary or set of generic type (and of variable kind), * [m-rbtree.h](#m-rbtree): header for creating binary sorted tree of generic type, * [m-bptree.h](#m-bptree): header for creating B+TREE of generic type, +* [m-tree.h](#m-tree): header for creating generic tree of generic type, * [m-tuple.h](#m-tuple): header for creating arbitrary tuple of generic type, * [m-variant.h](#m-variant): header for creating arbitrary variant of generic type, * [m-prioqueue.h](#m-prioqueue): header for creating priority queue of generic type and of variable size, @@ -2953,6 +2954,18 @@ Return true if 'it' references an element that is lower or equal than 'data'. +### M-TREE + +A [tree](https://en.wikipedia.org/wiki/Tree_(data_structure)) is an abstract data type +to represent the hierarchic nature of a structure with a set of connected nodes. +Each node in the tree can be connected to many children, +but must be connected to exactly one parent, +except for the root node, which has no parent. + +TODO: document API + + + ### M-PRIOQUEUE A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) is a queue