From 9ebd5fff5fe32b55494cc36bb9ff74147570fdef Mon Sep 17 00:00:00 2001 From: Timo Paloneva Date: Wed, 18 Sep 2024 15:56:26 +0300 Subject: [PATCH] edit 'sorted binary tree' section to point to corrected binary tree picture --- data/part-11/4-more-recursion-examples.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data/part-11/4-more-recursion-examples.md b/data/part-11/4-more-recursion-examples.md index d6dadda32..6441b0241 100644 --- a/data/part-11/4-more-recursion-examples.md +++ b/data/part-11/4-more-recursion-examples.md @@ -149,7 +149,7 @@ A binary tree is especially useful when the nodes are sorted in a certain way. T Let's take a look a tree which is sorted as follows: the left child of each node is smaller than the node itself, and the right child is correspondingly greater. - + Now we can write a recursive algorithm for searching for nodes. The idea is very similar to the binary search from the previous section: if the current node is the node we are looking for, return `True`. Else, continue recursively with either the left or the right child tree. If the node is not defined, return `False`.