Update README.md

README.md

@@ -176,7 +176,7 @@ void Findmaxpath(BTNode* bt, vector <int > apath, int asum)
 {
     if (bt == NULL)    //空树直接返回
         return;
-    apath.push_back(bt->data); asum += bt->data;    //bt结点加入apath
+    apath.push_back(bt->data);    //bt结点加入apath
     asum += bt->data;  //累计a路径和。
     if (bt->lchild == NULL && bt->rchild == NULL) //bt结点为叶结点
     {