Helpers to get the rightmost and leftmost node

This, due to the properties of a cw tree, will be the largest and
smallest fraction of the tree.

1 files changed, 16 insertions, 0 deletions

diff --git a/src/main.cpp b/src/main.cpp
index 87dec24..065f98a 100644
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -31,6 +31,22 @@
 #define LINE_TOP    (7 * HEIGHT / 16)
 #define LINE_BOTTOM (9 * HEIGHT / 16)
 
+Node rightmost_node(const NodeAllocator &allocator)
+{
+  auto node = allocator.getVal(0);
+  while (node.right.has_value())
+    node = allocator.getVal(node.right.value());
+  return node;
+}
+
+Node leftmost_node(const NodeAllocator &allocator)
+{
+  auto node = allocator.getVal(0);
+  while (node.left.has_value())
+    node = allocator.getVal(node.left.value());
+  return node;
+}
+
 
 int main(void)
 {