about summary refs log tree commit diff
path: root/emacs/.emacs.d/wpc/display.el
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-03-16T11·45+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-03-16T11·45+0000
commit319652fe08e50c00022b8caaa8ef357637393827 (patch)
tree577e684642c9164faeb41b469c6165822f145952 /emacs/.emacs.d/wpc/display.el
parent56d8d1d7b2ac2e6ea15150f5b2e72a26b721d927 (diff)
Solve InterviewCake's second-largest-item-in-bst
Return a function that returns the second largest item in a binary search
tree (i.e. BST).

A BST is a tree where each node has no more than two children (i.e. one left
child and one right child). All of the values in a BST's left subtree must be
less than the value of the root node; all of the values in a BST's right subtree
must be greater than the value of the root node; both left and right subtrees
must also be BSTs themselves.

I solved this problem thrice -- improving the performance profile each time. The
final solution has a runtime complexity of O(n) and a spacetime complexity of
O(1).
Diffstat (limited to 'emacs/.emacs.d/wpc/display.el')
0 files changed, 0 insertions, 0 deletions