You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: Binary Tree/README.markdown
+1-1
Original file line number
Diff line number
Diff line change
@@ -8,7 +8,7 @@ The child nodes are usually called the *left* child and the *right* child. If a
8
8
9
9
Often nodes will have a link back to their parent but this is not strictly necessary.
10
10
11
-
Binary trees are often used as [binary search trees](../Binary Search Tree/). In that case, the nodes must be in a specific order (smaller values on the left, larger values on the right). But this is not a requirement for all binary trees.
11
+
Binary trees are often used as [binary search trees](../Binary%20Search%20Tree/). In that case, the nodes must be in a specific order (smaller values on the left, larger values on the right). But this is not a requirement for all binary trees.
12
12
13
13
For example, here is a binary tree that represents a sequence of arithmetical operations, `(5 * (a - 10)) + (-4 * (3 / b))`:
0 commit comments