helib::FullBinaryTree Class Reference

A simple implementation of full binary trees (each non-leaf has 2 children) More...

#include <permutations.h>

Public Member Functions
	FullBinaryTree (long _aux=0)
	FullBinaryTree (const T &d, long _aux=0)
void	putDataInRoot (const T &d)
long	size ()
TreeNode< T > &	operator[] (long i)
const TreeNode< T > &	operator[] (long i) const
TreeNode< T > &	at (long i)
const TreeNode< T > &	at (long i) const
T &	DataOfNode (long i)
const T &	DataOfNode (long i) const
long	getAuxKey () const
void	setAuxKey (long _aux)
long	getNleaves () const
long	firstLeaf () const
long	nextLeaf (long i) const
long	prevLeaf (long i) const
long	lastLeaf () const
long	rootIdx () const
long	parentIdx (long i) const
long	leftChildIdx (long i) const
long	rightChildIdx (long i) const
void	printout (std::ostream &s, long idx=0) const
long	addChildren (long prntIdx, const T &leftData, const T &rightData)
void	collapseToRoot ()
	Remove all nodes in the tree except for the root. More...

Detailed Description

A simple implementation of full binary trees (each non-leaf has 2 children)

Constructor & Destructor Documentation

FullBinaryTree() [1/2]

helib::FullBinaryTree::FullBinaryTree ( long  _aux = 0 )

inline

FullBinaryTree() [2/2]

helib::FullBinaryTree::FullBinaryTree ( const T &  d, long  _aux = 0  )

inlineexplicit

Member Function Documentation

addChildren()

long helib::FullBinaryTree::addChildren	(	long	prntIdx,
		const T &	leftData,
		const T &	rightData
	)

If the parent is a leaf, add to it to children with the given data, else just update the data of the two children of this parent. Returns the index of the left child, the right-child index is one more than the left-child index.

at() [1/2]

TreeNode<T>& helib::FullBinaryTree::at ( long  i )

inline

at() [2/2]

const TreeNode<T>& helib::FullBinaryTree::at ( long  i ) const

inline

collapseToRoot()

void helib::FullBinaryTree::collapseToRoot ( )

inline

Remove all nodes in the tree except for the root.

DataOfNode() [1/2]

T& helib::FullBinaryTree::DataOfNode ( long  i )

inline

DataOfNode() [2/2]

const T& helib::FullBinaryTree::DataOfNode ( long  i ) const

inline

firstLeaf()

long helib::FullBinaryTree::firstLeaf ( ) const

inline

getAuxKey()

long helib::FullBinaryTree::getAuxKey ( ) const

inline

getNleaves()

long helib::FullBinaryTree::getNleaves ( ) const

inline

lastLeaf()

long helib::FullBinaryTree::lastLeaf ( ) const

inline

leftChildIdx()

long helib::FullBinaryTree::leftChildIdx ( long  i ) const

inline

nextLeaf()

long helib::FullBinaryTree::nextLeaf ( long  i ) const

inline

operator[]() [1/2]

TreeNode<T>& helib::FullBinaryTree::operator[] ( long  i )

inline

operator[]() [2/2]

const TreeNode<T>& helib::FullBinaryTree::operator[] ( long  i ) const

inline

parentIdx()

long helib::FullBinaryTree::parentIdx ( long  i ) const

inline

prevLeaf()

long helib::FullBinaryTree::prevLeaf ( long  i ) const

inline

printout()

void helib::FullBinaryTree::printout ( std::ostream &  s, long  idx = 0  ) const

inline

putDataInRoot()

void helib::FullBinaryTree::putDataInRoot ( const T &  d )

inline

rightChildIdx()

long helib::FullBinaryTree::rightChildIdx ( long  i ) const

inline

rootIdx()

long helib::FullBinaryTree::rootIdx ( ) const

inline

setAuxKey()

void helib::FullBinaryTree::setAuxKey ( long  _aux )

inline

size()

long helib::FullBinaryTree::size ( )

inline