sforman/Thun
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rebuild docs with Python 3 and Sphinx 3.0.2.

Browse Source
This commit is contained in:
Simon Forman
2020-04-28 15:37:49 -07:00
parent 176e427116
commit 7f6fcf6e09
150 changed files with 51415 additions and 41305 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/Ordered_Binary_Trees.md
-1
View File
@@ -1,4 +1,3 @@
# Treating Trees I: Ordered Binary Trees
Although any expression in Joy can be considered to describe a [tree](https://en.wikipedia.org/wiki/Tree_structure) with the quotes as compound nodes and the non-quote values as leaf nodes, in this page I want to talk about [ordered binary trees](https://en.wikipedia.org/wiki/Binary_search_tree) and how to make and use them.