/* Copyright (c) 2021 Dennis Wölfing
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/* libc/src/search/twalk.c
 * Walk a binary search tree.
 */

#include "tnode.h"

static void walk(const posix_tnode* node, int level,
        void (*action)(const posix_tnode*, VISIT, int)) {
    if (!node->left && !node->right) {
        action(node, leaf, level);
        return;
    }

    action(node, preorder, level);
    if (node->left) {
        walk(node->left, level + 1, action);
    }
    action(node, postorder, level);
    if (node->right) {
        walk(node->right, level + 1, action);
    }
    action(node, endorder, level);
}

void twalk(const posix_tnode* root,
        void (*action)(const posix_tnode*, VISIT, int)) {
    walk(root, 0, action);
}
