Update 105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp

xliu45 · xliu45 · commit e350616b6440 · 2016-03-04T21:08:48.000-06:00
diff --git a/C/105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp b/C/105_Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.cpp
@@ -2,14 +2,11 @@
 /*
 Given preorder and inorder traversal of a tree, construct the binary tree.
 
-Note:
-You may assume that duplicates do not exist in the tree.
+Note: You may assume that duplicates do not exist in the tree.
 
-Tag:
-Tree, Array, Depth-first-search
+Tag: Tree, Array, Depth-first-search
 
-Author:
-Xinyu Liu
+Author: Xinyu Liu
 */
 
 #include <iostream>
