helib::TreeNode< T > Class Template Reference
A node in a full binary tree. More...
#include <permutations.h>
Public Member Functions | |
TreeNode () | |
TreeNode (const T &d) | |
T & | getData () |
const T & | getData () const |
long | getParent () const |
long | getLeftChild () const |
long | getRightChild () const |
long | getPrev () const |
long | getNext () const |
Friends | |
class | FullBinaryTree< T > |
Detailed Description
template<typename T>
class helib::TreeNode< T >
A node in a full binary tree.
These nodes are in a std::vector, so we use indexes rather than pointers
Constructor & Destructor Documentation
◆ TreeNode() [1/2]
template<typename T >
|
inline |
◆ TreeNode() [2/2]
template<typename T >
|
inlineexplicit |
Member Function Documentation
◆ getData() [1/2]
template<typename T >
|
inline |
◆ getData() [2/2]
template<typename T >
|
inline |
◆ getLeftChild()
template<typename T >
|
inline |
◆ getNext()
template<typename T >
|
inline |
◆ getParent()
template<typename T >
|
inline |
◆ getPrev()
template<typename T >
|
inline |
◆ getRightChild()
template<typename T >
|
inline |
Friends And Related Function Documentation
◆ FullBinaryTree< T >
template<typename T >
|
friend |