}
//@}
- /// \brief return the largest node (right-most last node) in the
- /// tree.
- ///
- /// \return A \c DomainTreeNode that is largest in the tree. If the
- /// tree has no nodes, NULL will be returned.
- const DomainTreeNode<T>*
- getLargestNode() const;
-
/// \brief return the next bigger node in DNSSEC order from a given node
/// chain.
///
return (node);
}
-template <typename T>
-const DomainTreeNode<T>*
-DomainTree<T>::getLargestNode() const {
- const DomainTreeNode<T>* node = root_.get();
- if (node == NULL) {
- return (NULL);
- }
-
- while (node->getRight() != NULL) {
- node = node->getRight();
- }
-
- return (node);
-}
-
template <typename T>
typename DomainTree<T>::Result
DomainTree<T>::insert(util::MemorySegment& mem_sgmt,