Recursive programming on binary trees:computing depth

template <class T>

class treeNode{

public:

treeNode();

T getData() const;
treeNode <T> * getLC() const;
treeNode <T> * getRC() const;
void setData(T d);
void setLC(treeNode<T> * left);
void setRC(treeNode<T> * right);

private:

...

};

// in the user (client) program

int depth(treeNode<char> * T)

{

if (T == 0) return 0;

return (

1 +

max (depth(T->getLC( )),

depth(T->getRC( ))) );

}

Previous slide

Back to first slide

View graphic version