diff --git a/docs/source/authors.rst b/docs/source/authors.rst
index 5b12385bd..dbed41dc9 100644
--- a/docs/source/authors.rst
+++ b/docs/source/authors.rst
@@ -27,3 +27,5 @@ Harsheet <harsheetkakar@gmail.com>
 Pratik Goyal <pratikgoyal2712@gmail.com>
 
 Jay Thorat <j.thorat10@gmail.com>
+
+Kishan Ved <kishanved123456@gmail.com>
diff --git a/pydatastructs/linear_data_structures/arrays.py b/pydatastructs/linear_data_structures/arrays.py
index a0b3429af..2e0c3fd97 100644
--- a/pydatastructs/linear_data_structures/arrays.py
+++ b/pydatastructs/linear_data_structures/arrays.py
@@ -441,9 +441,8 @@ class ArrayForTrees(DynamicOneDimensionalArray):
     ==========
 
     backend: pydatastructs.Backend
-        The backend to be used.
-        Optional, by default, the best available
-        backend is used.
+        The backend to be used. Available backends: Python and C++
+        Optional, by default, the Python backend is used. For faster execution, use the C++ backend.
 
     See Also
     ========
diff --git a/pydatastructs/trees/binary_trees.py b/pydatastructs/trees/binary_trees.py
index 98206d548..4dc1fc3c8 100644
--- a/pydatastructs/trees/binary_trees.py
+++ b/pydatastructs/trees/binary_trees.py
@@ -44,9 +44,8 @@ class BinaryTree(object):
         Set it to True, if you want to use the
         order statistic features of the tree.
     backend: pydatastructs.Backend
-        The backend to be used.
-        Optional, by default, the best available
-        backend is used.
+        The backend to be used. Available backends: Python and C++
+        Optional, by default, the Python backend is used. For faster execution, use the C++ backend.
 
     References
     ==========
@@ -1573,9 +1572,8 @@ class BinaryTreeTraversal(object):
         The binary tree for whose traversal
         is to be done.
     backend: pydatastructs.Backend
-        The backend to be used.
-        Optional, by default, the best available
-        backend is used.
+        The backend to be used. Available backends: Python and C++
+        Optional, by default, the Python backend is used. For faster execution, use the C++ backend.
 
     Traversals
     ==========
@@ -1775,9 +1773,8 @@ class BinaryIndexedTree(object):
         The array whose elements are to be
         considered for the queries.
     backend: pydatastructs.Backend
-        The backend to be used.
-        Optional, by default, the best available
-        backend is used.
+        The backend to be used. Available backends: Python and C++
+        Optional, by default, the Python backend is used. For faster execution, use the C++ backend.
 
     Examples
     ========
diff --git a/pydatastructs/utils/misc_util.py b/pydatastructs/utils/misc_util.py
index 7a4caf606..4c7ca7faa 100644
--- a/pydatastructs/utils/misc_util.py
+++ b/pydatastructs/utils/misc_util.py
@@ -60,9 +60,8 @@ class TreeNode(Node):
     right: int
         Optional, index of the right child node.
     backend: pydatastructs.Backend
-        The backend to be used.
-        Optional, by default, the best available
-        backend is used.
+        The backend to be used. Available backends: Python and C++
+        Optional, by default, the Python backend is used. For faster execution, use the C++ backend.
     """
 
     __slots__ = ['key', 'data', 'left', 'right', 'is_root',