Update 105_construct_binary_tree_from_preorder_and_inorder_traversal.md

Joseph Luce · web-flow · commit 5b65026d26a5 · 2019-09-30T00:52:56.000-07:00
diff --git a/leetcode/medium/105_construct_binary_tree_from_preorder_and_inorder_traversal.md b/leetcode/medium/105_construct_binary_tree_from_preorder_and_inorder_traversal.md
@@ -6,7 +6,6 @@
 - N = Number of elements in list
 
 The preorder traversal is the pinnacle element.
-Without the preorder traversal, we will not be able to construct a binary tree given any combination of the other traversals.
 The property to be able to find the root node of the preorder traversal is key.
 
 Given preorder of [A,B,D,E,C,F,G] and inorder of [D,B,E,A,F,C,G].
