lower_bound() and upper_bound()

Author: Kishan-Ved

pydatastructs/trees/_backend/cpp/RedBlackTree.hpp

@@ -188,8 +188,18 @@ static PyObject* RedBlackTree_insert(RedBlackTree *self, PyObject* args) {
     Py_RETURN_NONE;
 }
 
+static PyObject* RedBlackTree_lower_bound(RedBlackTree* self, PyObject *args, PyObject *kwds) {
+    return BinarySearchTree_lower_bound(self->sbbt->bst, args, kwds);
+}
+
+static PyObject* RedBlackTree_upper_bound(RedBlackTree* self, PyObject *args, PyObject *kwds) {
+    return BinarySearchTree_upper_bound(self->sbbt->bst, args, kwds);
+}
+
 static struct PyMethodDef RedBlackTree_PyMethodDef[] = {
     {"insert", (PyCFunction) RedBlackTree_insert, METH_VARARGS, NULL},
+    {"lower_bound", (PyCFunction) RedBlackTree_lower_bound, METH_VARARGS | METH_KEYWORDS, NULL},
+    {"upper_bound", (PyCFunction) RedBlackTree_upper_bound, METH_VARARGS | METH_KEYWORDS, NULL},
     {NULL}
 };
 

pydatastructs/trees/tests/test_binary_trees.py

@@ -565,25 +565,25 @@ def test_RedBlackTree():
     assert [node.key for node in in_order] == [2, 6, 7, 10, 15, 16, 17, 18, 25, 30, 40, 60]
     assert [node.key for node in pre_order] == [16, 10, 6, 2, 7, 15, 25, 18, 17, 40, 30, 60]
 
-    # assert tree.lower_bound(0) == 2
-    # assert tree.lower_bound(2) == 2
-    # assert tree.lower_bound(3) == 6
-    # assert tree.lower_bound(7) == 7
-    # assert tree.lower_bound(25) == 25
-    # assert tree.lower_bound(32) == 40
-    # assert tree.lower_bound(41) == 60
-    # assert tree.lower_bound(60) == 60
-    # assert tree.lower_bound(61) is None
-
-    # assert tree.upper_bound(0) == 2
-    # assert tree.upper_bound(2) == 6
-    # assert tree.upper_bound(3) == 6
-    # assert tree.upper_bound(7) == 10
-    # assert tree.upper_bound(25) == 30
-    # assert tree.upper_bound(32) == 40
-    # assert tree.upper_bound(41) == 60
-    # assert tree.upper_bound(60) is None
-    # assert tree.upper_bound(61) is None
+    assert tree.lower_bound(0) == 2
+    assert tree.lower_bound(2) == 2
+    assert tree.lower_bound(3) == 6
+    assert tree.lower_bound(7) == 7
+    assert tree.lower_bound(25) == 25
+    assert tree.lower_bound(32) == 40
+    assert tree.lower_bound(41) == 60
+    assert tree.lower_bound(60) == 60
+    assert tree.lower_bound(61) is None
+
+    assert tree.upper_bound(0) == 2
+    assert tree.upper_bound(2) == 6
+    assert tree.upper_bound(3) == 6
+    assert tree.upper_bound(7) == 10
+    assert tree.upper_bound(25) == 30
+    assert tree.upper_bound(32) == 40
+    assert tree.upper_bound(41) == 60
+    assert tree.upper_bound(60) is None
+    assert tree.upper_bound(61) is None
 
     # tree = RedBlackTree()