Click here to Skip to main content
15,904,416 members
Please Sign up or sign in to vote.
4.00/5 (1 vote)
See more:
I'm having a little trouble with creating a function to find the average depth of a binary search tree. The definition of average depth of a tree is the sum of the depth of all nodes divided by the total number of nodes. The definition of the depth of a node is the distance from the root of the tree to the node. Can anyone help me?

So an example would be if you had a BST of:

   /   \
  3     8
 / \     \
2   4     9

Then the average depth is 1.571 because from 6 to 3 has depth of 1 and 6 to 2 has depth of 2. Do that for the rest of the nodes and sum them up then divide by the total number of nodes and that is the average depth. So it's (1 + 1 + 2 + 2 + 2 + 3)/7. Can anyone help me?
Updated 23-Apr-11 14:44pm

The problem is not finding the depth, the problem is to do it just once. Here is the way to do it: do not create a function for finding a depth of the current node. Instead, include the depth of a current node as a parameter of the recursive function.

void AccumulateNodeInfo(
    node * parent, uint parentDepth,
    uint & accumulatedDepth, uint & nodeCount);

Initialize accumulatedDepth and nodeCount to 0 and call this function with the root node. The function should call the current node's children with parentDepth + 1, add parentDepth to accumulatedDepth and increment the nodeCount. After this function traverses all the tree, accumulatedDepth will be equal to sum of the depths and nodeCount equal to the node count.

Share this answer
algrn912005 24-Apr-11 16:53pm    
Thank you, that worked beautifully.
Sergey Alexandrovich Kryukov 24-Apr-11 21:14pm    
Great. You're welcome.
Thanks for accepting this solution.
Good luck,
For every thing i do with trees i use walk functions.
Example for a walk function:
class INode
  INode*  _child;
  INode*  _next;

class IWalk
public: // IWalk
  virtual HRESULT Enter(INode* pNode) = 0;
  virtual HRESULT Leave(INode* pNode) = 0;

void Walk(INode* pNode,IWalk* pWalk)
  if(pNode && pWalk)
      for(INode* p=pNode->_child;p;p=p->_next) Walk(p,pWalk);

// implementation
class iWalk : public IWalk
public: // IWalk
  virtual HRESULT Enter(INode* pNode){ ++_node_count; _node_level_sum += _level; ++_level; return S_OK; }
  virtual HRESULT Leave(INode* pNode){ --_level; return S_OK; }

  iWalk(){ _node_count = _node_level_sum = _level = 0; }

  unsigned int  _node_count;
  unsigned int  _node_level_sum;
  unsigned int  _level;

double Calc()
  iWalk  w;
  return 0<w._node_count?(double)w._node_level_sum/(double)w._node_count:0;

Good luck.
Share this answer
You have to find average depth at once .I use this formula->
This you can find from the formula as we can find maximum no.of nodes by //n=(2^d)-1
Where d is depth of the tree.
Share this answer

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900