Skip to content

Instantly share code, notes, and snippets.

var kthSmallest = function(binaryTree, k) {
var arr = [];
var search = function(tree) {
if (arr.length<k) {
arr.push(tree.value)
search(tree.left);
search(tree.right);
} else {
if (tree.value < Math.max(arr)) {
arr.splice(arr.indexOf(Math.max(arr)));
class CashAmount {
constructor(double) {
this.amount = double;
}
totalAsPennies() {
return Math.floor(this.amount*100);
}
addDoubleAmount(double) {