Java实现二叉树的基本操作(二)

2014-11-24 08:54:17 · 作者: · 浏览: 2
1;
return leafNum(node.lChild)+leafNum(node.rChild);
}
}

class Treenode {
public String data;
public Treenode lChild;
public Treenode rChild;

// 构造函数
public Treenode(String data) {
this.data = data;
this.lChild = null;
this.rChild = null;
}

}
作者:lhfight