query: Binary Search Tree Induction
positive_passages.docid: 148376
positive_passages.text: Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$.
negative_passages.docid: 38739
negative_passages.text: Restrictions on universal generalization
negative_passages.docid: 81393
negative_passages.text: Asymptotic complexity of .NET collection classes
negative_passages.docid: 6113
negative_passages.text: Proof of Strong principle of Induction (T. Tao Analysis I)
negative_passages.docid: 77507
negative_passages.text: Induction without a base case
negative_passages.docid: 138857
negative_passages.text: Proving an inequality by induction, how to figure out intermediate inductive steps?
negative_passages.docid: 158083
negative_passages.text: If $G$ is a connected graph with $n$ vertices and $n - 1$ edges then $G$ is a tree, using Induction.
negative_passages.docid: 86122
negative_passages.text: Learning roadmap for additive combinatorics
negative_passages.docid: 54742
negative_passages.text: Ukkonen's suffix tree algorithm in plain English
negative_passages.docid: 127123
negative_passages.text: Cardinality of power set and binary sequence
negative_passages.docid: 14438
negative_passages.text: Trees with explicit formula
negative_passages.docid: 52676
negative_passages.text: Explanatory power of a Decision Tree
negative_passages.docid: 42105
negative_passages.text: Fibonacci proof by induction
negative_passages.docid: 25496
negative_passages.text: Avoiding proof by induction
negative_passages.docid: 21254
negative_passages.text: Formal language: Proving the reverse operation on a word through induction
negative_passages.docid: 26569
negative_passages.text: Counting binary operations on a set with $n$ elements
negative_passages.docid: 68801
negative_passages.text: Graph and one Sequence challenge