更新

Author: lazylzg

第10章数据结构二/10.1二叉树/10-1二叉树遍历.cpp

@@ -8,13 +8,16 @@ struct TreeNode {
     TreeNode(char c):data(c),leftChild(NULL),rightChild(NULL) {};
 };
 
-TreeNode* Build(int &position,string str) {
+TreeNode *Build(int &position,string str) {
     char c=str[position++];
     if(c=='#') {
         return NULL;
     }
+    //创建新节点
     TreeNode *root=new TreeNode(c);
+    //创建左子树
     root->leftChild=Build(position,str);
+    //创建右子树
     root->rightChild=Build(position,str);
     return root;
 }
@@ -36,7 +39,6 @@ int main() {
         InOrder(root);
         printf("\n");
     }
-
     return 0;
 }
 

第10章数据结构二/10.1二叉树/10-2二叉树遍历.cpp

@@ -8,17 +8,17 @@ struct TreeNode {
     TreeNode(char c):data(c),leftChild(NULL),rightChild(NULL) {};
 };
 
-TreeNode* Build(string str1,string str2) {
+TreeNode *Build(string str1,string str2) {
     if(str1.size()==0) {
         return NULL;
     }
-    //µ±Ç°×Ö·û
     char c=str1[0];
-    TreeNode *root=new TreeNode(c);
-    //Ñ°ÕÒÇзֵã
-    int position=str2.find(c);
-    root->leftChild=Build(str1.substr(1,position),str2.substr(0,position));
-    root->rightChild=Build(str1.substr(position+1),str2.substr(position+1));
+    //创建新节点
+    TreeNode *root = new TreeNode(c);
+    //寻找切分点
+    int pos=str2.find(c);
+    root->leftChild=Build(str1.substr(1,pos),str2.substr(0,pos));
+    root->rightChild=Build(str1.substr(pos+1),str2.substr(pos+1));
     return root;
 }
 

第10章数据结构二/10.2二叉排序树/10-3二叉排序树.cpp

@@ -11,14 +11,11 @@ struct TreeNode {
 
 TreeNode* Insert(TreeNode*root,int data,int father) {
     if(root==NULL) {
-        //创建新节点
         root=new TreeNode(data);
         printf("%d\n",father);
     } else if(data<root->data) {
-        //插入左子树
         root->leftChild=Insert(root->leftChild,data,root->data);
     } else {
-        //插入右子树
         root->rightChild=Insert(root->rightChild,data,root->data);
     }
     return root;
@@ -27,11 +24,11 @@ TreeNode* Insert(TreeNode*root,int data,int father) {
 int main() {
     int n;
     while(scanf("%d",&n)!=EOF) {
-        TreeNode* root=NULL;
-        int data;
+        TreeNode *root=NULL;
         for(int i=0; i<n; i++) {
-            scanf("%d",&data);
-            root=Insert(root,data,-1);
+            int x;
+            scanf("%d",&x);
+            root=Insert(root,x,-1);
         }
     }
     return 0;