summaryrefslogtreecommitdiff
path: root/spec/binary_trees
AgeCommit message (Collapse)Author
2017-09-13delete from bst without recursive deletemokha
2017-08-20consider using min of right tree instead of max from left subtree.mo
2017-08-20add spec 12.mo
2017-08-20add spec 11.mo
2017-08-20null -> nilmo
2017-08-20add spec 10.mo
2017-08-20add spec 9.mo
2017-08-20add spec 8.mo
2017-08-20add surrounding hash.mo
2017-08-20add spec 8.mo
2017-08-20fix broken spec.mo
2017-08-15add test to produce a failure.mo
2017-08-15min -> maxmo
2017-08-15solve base tests.mo
2017-08-15first cut.mo
2017-08-15add delete from BST.mo
2017-08-12remove unneccessary variable.mo
2017-08-12increase performance.mo
2017-08-12sort the parts.mo
2017-08-12optimize search.mo
2017-08-12try sexp (FAIL)mo
2017-08-12brute force solution.mo
2017-08-11sort parts.mo
2017-08-09first attempt regex matching.mo
2017-08-09add find substrings problem.mo
2017-08-09rename index to pivot.mo
2017-08-09remove extra params and global var.mo
2017-08-09find_index -> indexmo
2017-08-09remove search method.mo
2017-08-09collapse method.mo
2017-08-09remove usage of Tree class and use hash.mo
2017-08-09reduce params to search method.mo
2017-08-09shrink the search.mo
2017-08-09solve rebuilding tree.mo
2017-08-08add restore_binary_treemo
2017-08-08sold is subtree.mo
2017-08-08pass practice tests.mo
2017-08-08add specs.mo
2017-08-08add is_subtree problem.mo
2017-08-08remove need to extra array allocation.mo
2017-08-08use ruby Enumerator. time O(k), space O(1)mo
2017-08-08remove extra instance var.mo
2017-08-08O(1) space solution.mo
2017-08-08remove unneccesary check for leaf.mo
2017-08-08solve using recursion.mo
2017-08-08add kthlargest problem.mo
2017-08-06implement find profession.mo
2017-08-06add alternate solution.mo
2017-08-05solve tree symetry.mo
2017-08-05print if there is a tree.mo