MTREE_SUBTREE_DATA(3)

💖 MTREE_SUBTREE_DATA 💖

okay bestie, welcome to the Librecast programmer's manual, specifically the mtree_subtree_data_min and mtree_subtree_data_max girlies 💅 they live in the liblibrecast library (that's -llibrecast when you're linking, iykyk) and they are here to hand you the minmax data nodes of a subtree. so slay.

✨ NAME ✨

mtree_subtree_data_min, mtree_subtree_data_max — return minmax data nodes 🎀

🌸 LIBRARY 🌸

Librecast library (liblibrecast, -llibrecast)

🦋 SYNOPSIS 🦋

#include <librecast/mtree.h>

size_t mtree_subtree_data_min(size_t base, size_t root);
size_t mtree_subtree_data_max(size_t base, size_t root);

Compile and link with -llibrecast. 🫶

💜 DESCRIPTION 💜

so here's the vibe: mtree_subtree_data_min and mtree_subtree_data_max hand you back the node number of the minimum and maximum data nodes respectively — that's one each, no cap — for the subtree with root node root in a tree that's got base data nodes. ✨

and the numbering? nodes are numbered from 0 = root. the root is the main character, everyone else is just living in its orbit. periodt.

🌈 RETURN VALUE 🌈

these functions return the number of the min or max data node, as appropriate. so like, whichever one you asked for. iconic behaviour honestly. 💅

💀 ERRORS 💀

None. literally none. not a single error to be found, bestie — it's giving flawless. 🙈

👑 SEE ALSO 👑

• mtree_init(3)
• mtree_free(3)
• mtree_build(3)
• mtree_child(3)
• mtree_parent(3)

okay that's the whole page, you ate it up fr fr 💖 this was brought to you by LIBRECAST, dated 2023-07-23, and yes the manual section is MTREE_SUBTREE_DATA(3) — go forth and index your trees, mwah 🎀✨