diff --git a/APP_Framework/Applications/app_test/test_radix_tree/fig6.png b/APP_Framework/Applications/app_test/test_radix_tree/fig6.png
index 80bf28136..a8f0ab9c0 100644
Binary files a/APP_Framework/Applications/app_test/test_radix_tree/fig6.png and b/APP_Framework/Applications/app_test/test_radix_tree/fig6.png differ
diff --git a/APP_Framework/Applications/app_test/test_radix_tree/fig7.png b/APP_Framework/Applications/app_test/test_radix_tree/fig7.png
index 7fad83c9e..4b1073ba4 100644
Binary files a/APP_Framework/Applications/app_test/test_radix_tree/fig7.png and b/APP_Framework/Applications/app_test/test_radix_tree/fig7.png differ
diff --git a/APP_Framework/Applications/app_test/test_radix_tree/test_radix_tree.c b/APP_Framework/Applications/app_test/test_radix_tree/test_radix_tree.c
index 8fc455da7..a2c96e15e 100644
--- a/APP_Framework/Applications/app_test/test_radix_tree/test_radix_tree.c
+++ b/APP_Framework/Applications/app_test/test_radix_tree/test_radix_tree.c
@@ -57,7 +57,7 @@ int InsertNode(radix_node *root, unsigned int key, void *value)
         return -3; // Repeat insertion
     if (cur->value != NULL)
         return -4; // Already occupied
-    cur->value == value;
+    cur->value = value;
     return 0;
 }
 
@@ -159,9 +159,9 @@ void TestRadix()
 
     for (int i = 0; i < num; ++i)
     {
-        int *v = (int *)FindNode(root, keys[i]);
+        char *v = (char *)FindNode(root, keys[i]);
         if (v)
-            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v);
+            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
         else
             printf("keys[%d] %x not found\n", i, keys[i]);
     }
@@ -172,9 +172,9 @@ void TestRadix()
 
     for (int i = 0; i < num; ++i)
     {
-        int *v = (int *)FindNode(root, keys[i]);
+        char *v = (char *)FindNode(root, keys[i]);
         if (v)
-            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v);
+            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
         else
             printf("keys[%d] %x not found\n", i, keys[i]);
     }
@@ -185,9 +185,9 @@ void TestRadix()
 
     for (int i = 0; i < num; ++i)
     {
-        int *v = (int *)FindNode(root, keys[i]);
+        char *v = (char *)FindNode(root, keys[i]);
         if (v)
-            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v);
+            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
         else
             printf("keys[%d] %x not found\n", i, keys[i]);
     }
@@ -198,9 +198,9 @@ void TestRadix()
 
     for (int i = 0; i < num; ++i)
     {
-        int *v = (int *)FindNode(root, keys[i]);
+        char *v = (char *)FindNode(root, keys[i]);
         if (v)
-            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v);
+            printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
         else
             printf("keys[%d] %x not found\n", i, keys[i]);
     }