Update README.md

README.md

@@ -62,8 +62,8 @@ void Findmaxpath(BTNode* bt, vector <int > apath, int asum)
 {
     if (bt == NULL)    //空树直接返回
         return;
-    apath.push_back(bt->data); asum += bt->data;    //bt结点加入apath
-    asum += bt->data;  //累计a路径和。
+    apath.push_back(bt->data); 
+	asum += bt->data;    //bt结点加入apath
     if (bt->lchild == NULL && bt->rchild == NULL) //bt结点为叶结点
     {
         if (asum - maxsum)
@@ -99,6 +99,7 @@ int main()
     DestroyBTree(bt);
 }
 
+
 ##############################
 
 #include <stdio.h>