пройти по двоичному дереву поиска (traverse a binary search tree)
Пролог (Prolog)
This manual page is part of the POSIX Programmer's Manual. The
Linux implementation of this interface may differ (consult the
corresponding Linux manual page for details of Linux behavior),
or the interface may not be implemented on Linux.
Имя (Name)
twalk — traverse a binary search tree
Синопсис (Synopsis)
#include <search.h>
void twalk(const void *root,
void (*action)(const void *, VISIT, int ));
Описание (Description)
Refer to tdelete(3p).
