refactor 1008

fishercoder1534 · fishercoder1534 · commit 8c55fdab3482 · 2020-04-20T07:09:53.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1008.java b/src/main/java/com/fishercoder/solutions/_1008.java
@@ -6,8 +6,8 @@
  * 1008. Construct Binary Search Tree from Preorder Traversal
  *
  * Return the root node of a binary search tree that matches the given preorder traversal.
- * (Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val.  Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)
- *
+ * (Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val.
+ * Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)
  *
  * Example 1:
  *

Original file line number	Diff line number	Diff line change
`@@ -6,8 +6,8 @@`
`6`	`6`	`* 1008. Construct Binary Search Tree from Preorder Traversal`
`7`	`7`	`*`
`8`	`8`	`* Return the root node of a binary search tree that matches the given preorder traversal.`
`9`		`- * (Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val. Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)`
`10`		`- *`
	`9`	`+ * (Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val.`
	`10`	`+ * Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)`
`11`	`11`	`*`
`12`	`12`	`* Example 1:`
`13`	`13`	`*`