Template Function ADS::isSearchTree

Defined in File BinaryTreeAlgorithms.h

Function Documentation

template<KeyedBinaryNode N, class Compare = std::less<>> bool ADS::isSearchTree(N t, Compare less = {}): isSearchTree(): the keys of t are strictly increasing in the invisit, by less; O( n ) time, O( h ) space