We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 02d583e commit b36304cCopy full SHA for b36304c
Red-Black Tree/README.markdown
@@ -39,6 +39,9 @@ Tree:
39
* `insert(key:)` Inserts the key value into the tree
40
* `delete(key:)` Delete the node with the respective key value from the tree
41
* `verify()` Verifies that the given tree fulfills the red-black tree properties
42
+* `count()` Returns how many nodes in the tree
43
+* `isEmpty()` Returns if the tree has no nodes
44
+* `allElements()` Returns an array containing all nodes (in-order traversal) in the tree.
45
46
The rotation, insertion and deletion algorithms are implemented based on the pseudo-code provided in [CLRS]
47
0 commit comments