From 662a06874b253bcea554a7e542cdf1af9982b10e Mon Sep 17 00:00:00 2001 From: lee Date: Wed, 26 Jun 2019 09:47:54 +0100 Subject: [PATCH] reademe btreedeletenode from quest 12 --- subjects/btreedeletenode.en.md | 28 +++++++++++++--------------- subjects/btreedeletenode.fr.md | 28 +++++++++++++--------------- 2 files changed, 26 insertions(+), 30 deletions(-) diff --git a/subjects/btreedeletenode.en.md b/subjects/btreedeletenode.en.md index c367fe05..d308f08b 100644 --- a/subjects/btreedeletenode.en.md +++ b/subjects/btreedeletenode.en.md @@ -2,12 +2,10 @@ ### Instructions -Write a function, BTreeDeleteNode, that deletes 'node' from the tree given by root. +Write a function, `BTreeDeleteNode`, that deletes `node` from the tree given by root. The resulting tree should still follow the binary search tree rules. -This function must have the following signature. - ### Expected function ```go @@ -26,28 +24,28 @@ 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, "4") + root := &piscine.TreeNode{Data: "4"} + piscine.BTreeInsertData(root, "1") + piscine.BTreeInsertData(root, "7") + piscine.BTreeInsertData(root, "5") + node := piscine.BTreeSearchItem(root, "4") fmt.Println("Before delete:") - student.BTreeApplyInorder(root, fmt.Println) - root = student.BTreeDeleteNode(root, node) + piscine.BTreeApplyInorder(root, fmt.Println) + root = piscine.BTreeDeleteNode(root, node) fmt.Println("After delete:") - student.BTreeApplyInorder(root, fmt.Println) + piscine.BTreeApplyInorder(root, fmt.Println) } ``` And its output : ```console -student@ubuntu:~/student/btreedeletenode$ go build -student@ubuntu:~/student/btreedeletenode$ ./btreedeletenode +student@ubuntu:~/student/test$ go build +student@ubuntu:~/student/test$ ./test Before delete: 1 4 @@ -57,5 +55,5 @@ After delete: 1 5 7 -student@ubuntu:~/student/btreedeletenode$ +student@ubuntu:~/student/test$ ``` diff --git a/subjects/btreedeletenode.fr.md b/subjects/btreedeletenode.fr.md index c367fe05..d308f08b 100644 --- a/subjects/btreedeletenode.fr.md +++ b/subjects/btreedeletenode.fr.md @@ -2,12 +2,10 @@ ### Instructions -Write a function, BTreeDeleteNode, that deletes 'node' from the tree given by root. +Write a function, `BTreeDeleteNode`, that deletes `node` from the tree given by root. The resulting tree should still follow the binary search tree rules. -This function must have the following signature. - ### Expected function ```go @@ -26,28 +24,28 @@ 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, "4") + root := &piscine.TreeNode{Data: "4"} + piscine.BTreeInsertData(root, "1") + piscine.BTreeInsertData(root, "7") + piscine.BTreeInsertData(root, "5") + node := piscine.BTreeSearchItem(root, "4") fmt.Println("Before delete:") - student.BTreeApplyInorder(root, fmt.Println) - root = student.BTreeDeleteNode(root, node) + piscine.BTreeApplyInorder(root, fmt.Println) + root = piscine.BTreeDeleteNode(root, node) fmt.Println("After delete:") - student.BTreeApplyInorder(root, fmt.Println) + piscine.BTreeApplyInorder(root, fmt.Println) } ``` And its output : ```console -student@ubuntu:~/student/btreedeletenode$ go build -student@ubuntu:~/student/btreedeletenode$ ./btreedeletenode +student@ubuntu:~/student/test$ go build +student@ubuntu:~/student/test$ ./test Before delete: 1 4 @@ -57,5 +55,5 @@ After delete: 1 5 7 -student@ubuntu:~/student/btreedeletenode$ +student@ubuntu:~/student/test$ ```