WPL算法（二叉树问题）

算法（二叉树问题）"/>

WPL算法（二叉树问题）

//WPL算法 
#include<stdio.h>
typedef struct BiTree{struct BiTree *lchild,*rchild;int weight;
}Lnode,*BiTree;//基于先序遍历的算法
int WPL(BiTree T)
{WPL_PreOrder(T,0);
}
int WPL_PreOrder(BiTree T,int deep) 
{static wpl=0;if(T->lchild == NULL && T->rchild == NULL){wpl += deep*T->weight;}if(T->lchild != NULL){deep++;WPL_PreOrder(T->lchild,deep);}if(T->rchild != NULL){deep++;WPL_PreOrder(T->rchild,deep);}
}
int main()
{}