-
Utkarsh Upadhyay authored
1. Reduced irksome debug 'warnings' from the code. 2. Changed (C != {}) to ( |C| > 0 ) 3. Removed duplicated cardinality constraints Also added a small 'ordered' part to the post condition of dumbInsert. Makes the execution time jump from a few milliseconds to a whooping 12+ minutes.
Utkarsh Upadhyay authored1. Reduced irksome debug 'warnings' from the code. 2. Changed (C != {}) to ( |C| > 0 ) 3. Removed duplicated cardinality constraints Also added a small 'ordered' part to the post condition of dumbInsert. Makes the execution time jump from a few milliseconds to a whooping 12+ minutes.
BinarySearchTree.scala 3.96 KiB