Implement recursive inorder traversal of binary tree

1 files changed, 9 insertions, 0 deletions

diff --git a/src/02/01/binary_tree.c b/src/02/01/binary_tree.c
index 00abae5..7cdd197 100644
--- a/src/02/01/binary_tree.c
+++ b/src/02/01/binary_tree.c
@@ -18,6 +18,15 @@ void preorder_traversal(Node *node, Visitor visitor) {
   preorder_traversal(node->right, visitor);
 }
 
+void inorder_traversal(Node *node, Visitor visitor) {
+  if (!node)
+    return;
+
+  inorder_traversal(node->left, visitor);
+  visitor(node);
+  inorder_traversal(node->right, visitor);
+}
+
 void postorder_traversal(Node *node, Visitor visitor) {
   if (!node)
     return;