实验一添加注释
This commit is contained in:
@@ -1,3 +1,6 @@
|
|||||||
|
/*
|
||||||
|
*二叉树采用二叉链存储结构存放,结点值为int 类型,设计一个递归算法求二叉树 bt 中所有叶子结点值之和
|
||||||
|
*/
|
||||||
#include<iostream>
|
#include<iostream>
|
||||||
#include"BiTree.h"
|
#include"BiTree.h"
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|||||||
Reference in New Issue
Block a user