diff --git a/subjects/btreeapplyinorder.en.md b/subjects/btreeapplyinorder.en.md index e182df073..bfd30ea09 100644 --- a/subjects/btreeapplyinorder.en.md +++ b/subjects/btreeapplyinorder.en.md @@ -1,4 +1,4 @@ -## btreeinsertdata +## btreeapplyinorder ### Instructions diff --git a/subjects/btreeapplypostorder.en.md b/subjects/btreeapplypostorder.en.md index e386d350c..327b44580 100644 --- a/subjects/btreeapplypostorder.en.md +++ b/subjects/btreeapplypostorder.en.md @@ -1,4 +1,4 @@ -## btreeinsertdata +## btreeapplypostorder ### Instructions diff --git a/subjects/btreeapplypreorder.en.md b/subjects/btreeapplypreorder.en.md index 4a43b56a0..96e68bc30 100644 --- a/subjects/btreeapplypreorder.en.md +++ b/subjects/btreeapplypreorder.en.md @@ -1,4 +1,4 @@ -## btreeinsertdata +## btreeapplypreorder ### Instructions diff --git a/subjects/btreeisbinary.en.md b/subjects/btreeisbinary.en.md index 2a93d3143..578f7c3f9 100644 --- a/subjects/btreeisbinary.en.md +++ b/subjects/btreeisbinary.en.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, BTreeIsBinary, that returns true only if the tree given by root follows the binary search tree properties. +Write a function, `BTreeIsBinary`, that returns true only if the tree given by root follows the binary search tree properties. This function must have the following signature. diff --git a/subjects/btreelevelcount.en.md b/subjects/btreelevelcount.en.md index ef9c7806f..14a097e54 100644 --- a/subjects/btreelevelcount.en.md +++ b/subjects/btreelevelcount.en.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, BTreeLevelCount, that return the number of levels of the tree (height of the tree) +Write a function, `BTreeLevelCount`, that return the number of levels of the tree (height of the tree) ### Expected function diff --git a/subjects/btreesearchitem.en.md b/subjects/btreesearchitem.en.md index 2367eeada..6cfa461d7 100644 --- a/subjects/btreesearchitem.en.md +++ b/subjects/btreesearchitem.en.md @@ -1,4 +1,4 @@ -## btreeinsertdata +## btreesearchitem ### Instructions