11#ifndef QUETZAL_TREE_ADL_H_INCLUDED
12#define QUETZAL_TREE_ADL_H_INCLUDED
17namespace adl_resolution
19void add_edge() =
delete;
20void add_left_edge() =
delete;
21void add_right_edge() =
delete;
22void add_vertex() =
delete;
23void out_degree() =
delete;
25void is_left_successor() =
delete;
26void is_right_successor() =
delete;
27void has_predecessor() =
delete;
28void predecessor() =
delete;
29void depth_first_search() =
delete;
30void isomorphism() =
delete;
31void in_edges() =
delete;
32void degree() =
delete;
Definition binary_tree.hpp:37