From caa5aa613dc5a10f50bc784dd0b85bf6f6258986 Mon Sep 17 00:00:00 2001
From: lee <lee-dasilva@hotmail.com>
Date: Tue, 25 Jun 2019 15:11:33 +0100
Subject: [PATCH] readme btreetransplant from quest 12

---
 subjects/btreetransplant.en.md | 26 +++++++++++++-------------
 subjects/btreetransplant.fr.md | 26 +++++++++++++-------------
 2 files changed, 26 insertions(+), 26 deletions(-)

diff --git a/subjects/btreetransplant.en.md b/subjects/btreetransplant.en.md
index e80939149..50beed3a3 100644
--- a/subjects/btreetransplant.en.md
+++ b/subjects/btreetransplant.en.md
@@ -2,7 +2,7 @@
 
 ### Instructions
 
-In order to move subtrees around within the binary search tree, write a function, BTreeTransplant, which replaces the subtree started by node with the node called 'rplc' in the tree given by root.
+In order to move subtrees around within the binary search tree, write a function, `BTreeTransplant`, which replaces the subtree started by `node` with the node called `rplc` in the tree given by `root`.
 
 This function must have the following signature.
 
@@ -23,29 +23,29 @@ package main
 
 import (
 	"fmt"
-	student ".."
+	piscine ".."
 )
 
 func main() {
-	root := &student.TreeNode{Data: "4"}
-	student.BTreeInsertData(root, "1")
-	student.BTreeInsertData(root, "7")
-	student.BTreeInsertData(root, "5")
-	node := student.BTreeSearchItem(root, "1")
-	replacement := &student.TreeNode{Data: "3"}
-	root = student.BTreeTransplant(root, node, replacement)
-	student.BTreeApplyInorder(root, fmt.Println)
+	root := &piscine.TreeNode{Data: "4"}
+	piscine.BTreeInsertData(root, "1")
+	piscine.BTreeInsertData(root, "7")
+	piscine.BTreeInsertData(root, "5")
+	node := piscine.BTreeSearchItem(root, "1")
+	replacement := &piscine.TreeNode{Data: "3"}
+	root = piscine.BTreeTransplant(root, node, replacement)
+	piscine.BTreeApplyInorder(root, fmt.Println)
 }
 ```
 
 And its output :
 
 ```console
-student@ubuntu:~/student/btreetransplant$ go build
-student@ubuntu:~/student/btreetrandsplant$ ./btreetransplant
+student@ubuntu:~/student/test$ go build
+student@ubuntu:~/student/test$ ./test
 3
 4
 5
 7
-student@ubuntu:~/student/btreetrandsplant$
+student@ubuntu:~/student/test$
 ```
diff --git a/subjects/btreetransplant.fr.md b/subjects/btreetransplant.fr.md
index e80939149..50beed3a3 100644
--- a/subjects/btreetransplant.fr.md
+++ b/subjects/btreetransplant.fr.md
@@ -2,7 +2,7 @@
 
 ### Instructions
 
-In order to move subtrees around within the binary search tree, write a function, BTreeTransplant, which replaces the subtree started by node with the node called 'rplc' in the tree given by root.
+In order to move subtrees around within the binary search tree, write a function, `BTreeTransplant`, which replaces the subtree started by `node` with the node called `rplc` in the tree given by `root`.
 
 This function must have the following signature.
 
@@ -23,29 +23,29 @@ package main
 
 import (
 	"fmt"
-	student ".."
+	piscine ".."
 )
 
 func main() {
-	root := &student.TreeNode{Data: "4"}
-	student.BTreeInsertData(root, "1")
-	student.BTreeInsertData(root, "7")
-	student.BTreeInsertData(root, "5")
-	node := student.BTreeSearchItem(root, "1")
-	replacement := &student.TreeNode{Data: "3"}
-	root = student.BTreeTransplant(root, node, replacement)
-	student.BTreeApplyInorder(root, fmt.Println)
+	root := &piscine.TreeNode{Data: "4"}
+	piscine.BTreeInsertData(root, "1")
+	piscine.BTreeInsertData(root, "7")
+	piscine.BTreeInsertData(root, "5")
+	node := piscine.BTreeSearchItem(root, "1")
+	replacement := &piscine.TreeNode{Data: "3"}
+	root = piscine.BTreeTransplant(root, node, replacement)
+	piscine.BTreeApplyInorder(root, fmt.Println)
 }
 ```
 
 And its output :
 
 ```console
-student@ubuntu:~/student/btreetransplant$ go build
-student@ubuntu:~/student/btreetrandsplant$ ./btreetransplant
+student@ubuntu:~/student/test$ go build
+student@ubuntu:~/student/test$ ./test
 3
 4
 5
 7
-student@ubuntu:~/student/btreetrandsplant$
+student@ubuntu:~/student/test$
 ```