节点最大距离--数据结构.docVIP

  • 1
  • 0
  • 约 2页
  • 2017-08-20 发布于河北
  • 举报
struct NODE{ NODE* pLeft; NODE* pRight; int nMaxLeft; int nMaxRight; char chValue; }; int nMaxLen = 0; void FindMaxLen(NODE* pRoot){ if(pRoot == NULL){ return; } if(pRoot-pLeft == NULL){ pRoot-nMaxLeft = 0; } if(pRoot-pRight == NULL){ pRoot-nMaxRight = 0; } if(pRoot-pLeft != NULL){ FindMaxLen(pRoot-pLeft); } if(pRoot-pRight != NULL){ FindMaxLen(pRoot-pRight); } if(pRoot-pLeft!=NULL){ int nTempMax = 0; if(pRoot-pLeft-nMaxLeft pRoot-pLeft-nMaxRight){ nTempMax = pRoot-pLeft-nMaxLeft; } else{ nTempMax = pRoot-pLeft-nMaxRight; } pRoot-nMaxLeft = nTempMax+1;

文档评论(0)

1亿VIP精品文档

相关文档