From 47400bdee5ab137729db5a3fee7850ab1e140416 Mon Sep 17 00:00:00 2001
From: mo khan <mo.khan@gmail.com>
Date: Sun, 19 Jul 2020 12:11:54 -0600
Subject: Use a recursive stack to determine if a btree is a bst

---
 doc/mit-ocw/bst.md | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 doc/mit-ocw/bst.md

(limited to 'doc')

diff --git a/doc/mit-ocw/bst.md b/doc/mit-ocw/bst.md
new file mode 100644
index 0000000..9c8cb4d
--- /dev/null
+++ b/doc/mit-ocw/bst.md
@@ -0,0 +1,9 @@
+# Scheduling & Binary Search Trees
+
+* Airport with a single runway.
+* Reservations for future landings.
+* Reserve request specifies landing time t
+* Add `t` to the set `R` of landing times if no other landings are scheduled within `k` minutes.
+* Remove from set `R` after plane lands.
+* `|R| = n`
+* `O(lg n)` time where `n` is the size of the set.
-- 
cgit v1.2.3