jeantimex / javascript-problems-and-solutions

100%

master: 99%

LAST BUILD ON BRANCH kth-smallest-element-in-a-bst

branch: kth-smallest-element-in-a-bst

CHANGE BRANCH

x

Reset

• kth-smallest-element-in-a-bst
• 4-keys-keyboard
• add-and-search-word-data-structure-design
• add-bold-tag-in-string
• add-bold-tag-in-string-solution-ii
• add-one-row-to-tree
• add-release-script
• add-stack-and-queue
• add-strings
• add-tree-problem
• add-tree-readme
• add-tree-test-cases
• add-two-numbers
• alien-dictionary
• babel-plugin-module-resolver
• balanced-binary-tree
• basic-calculator
• beautiful-arrangement-ii
• best-time-to-buy-and-sell-stock
• binary-search
• binary-search-in-rotated-array
• binary-search-tree-iterator
• binary-tree-inorder-traversal
• binary-tree-level-order-traversal
• binary-tree-longest-consecutive-sequence
• binary-tree-maximum-path-sum
• binary-tree-paths
• binary-tree-postorder-traversal
• binary-tree-preorder-traversal
• binary-tree-upside-down
• binary-tree-zigzag-level-order-traversal
• binary-watch
• bold-words-in-string
• brick-wall
• bst-basic
• buddy-strings
• clone-graph
• closest-binary-search-tree-value
• closest-binary-search-tree-value-ii
• code-coverage
• code-refactor
• combination-sum
• combination-sum-ii
• combination-sum-iii
• combinations
• concatenated-words
• construct-binary-tree-from-preorder-and-inorder-traversal
• convert-bst-to-greater-tree
• convert-sorted-array-to-binary-search-tree
• count-numbers-with-unique-digits
• count-unique-bst
• count-univalue-subtrees
• course-schedule
• course-schedule-ii
• daily-temperatures
• decode-string
• delete-node-in-a-bst
• delete-operation-for-two-strings
• design-phone-directory
• design-search-autocomplete-system
• design-tic-tac-toe
• detect-capital
• diameter-of-binary-tree
• divide
• escape-the-ghosts
• eslint
• evaluate-division
• expression-add-operators
• find-anagram-mappings
• find-bottom-left-tree-value
• find-largest-value-in-each-tree-row
• find-mode-in-binary-search-tree
• find-permutation
• fix-release
• fixed-clone-graph
• flatten-2d-vector
• flatten-binary-tree-to-linked-list
• flatten-nested-list-iterator
• flipping-an-image
• gas-stagion
• generate-parentheses
• generate-parentheses-ii
• google-string-problems
• google-warm-up-problems
• graph-valid-tree
• guess-number-higher-or-lower-ii
• hamming-distance
• heap-sort
• house-robber-iii
• implement-magic-dictionary
• implement-trie-prefix-tree
• increasing-triplet-subsequence
• inorder-predecessor-in-bst
• insert-delete-getrandom-o1
• insert-into-a-cyclic-sorted-list
• insertion-sort
• island-perimeter
• jeantimex-patch-1
• keys-and-rooms
• kill-process
• kth-ancestor-in-binary-tree
• kth-largest-element-in-an-array
• largest-sum-of-averages
• largest-triangle-area
• letter-case-permutation
• letter-combinations-of-a-phone-number
• lfu-cache
• linked-list-random-node
• lonely-pixel-i
• longest-absolute-path
• longest-palindromic-substring
• longest-substring-without-repeating-characters
• longest-univalue-path
• longest-word-in-dictionary
• lowest-common-ancestor-of-a-binary-search-tree
• lowest-common-ancestor-of-a-binary-tree
• lru-cache
• magic-squares-in-grid
• magical-string
• map-sum-pairs
• master
• max-consecutive-ones
• max-consecutive-ones-ii
• max-stack
• maximize-distance-to-closest-person
• maximum-average-subarray-i
• maximum-binary-tree
• maximum-depth-of-binary-tree
• maximum-sum-of-3-non-overlapping-subarrays
• maximum-width-of-binary-tree
• maximum-xor-of-two-numbers-in-an-array
• median-of-two-sorted-arrays
• meeting-rooms-ii
• merge-intervals
• merge-k-sorted-linked-lists
• merge-sort
• min-stack
• minesweeper
• minimum-depth-of-binary-tree
• minimum-height-trees
• minimum-window-substring
• most-frequent-subtree-sum
• moving-average-from-data-stream
• n-queens
• n-queens-ii
• non-decreasing-array
• nth-digit
• number-of-boomerangs
• number-of-connected-components-in-an-undirected-graph
• number-of-corner-rectangles
• number-of-islands
• odd-even-linked-list
• optimize-minimum-height-tree-solution
• output-contest-matches
• palindrome-pairs
• palindromic-subsequence
• path-sum
• path-sum-ii
• path-sum-iii
• path-sum-iv
• perfect-square
• permutations
• permutations-ii
• plus-one
• populating-next-right-pointers-in-each-node
• populating-next-right-pointers-in-each-node-ii
• power-of-three
• power-of-two
• priority-queue
• queue-reconstruction-by-height
• quick-sort
• quick-sort-refactor
• random-pick-index
• reconstruct-itinerary
• recover-binary-search-tree
• redundant-connection
• redundant-connection-ii
• regular-expression-matching
• relative-ranks
• remove-changelog
• remove-corp-semantic-release
• remove-duplicate-letters
• remove-generate-changelog
• remove-linked-list-elements
• remove-nth-node-from-end-of-list
• remove-obstacles-in-maze
• repeated-string-match.js
• repeated-substring-pattern
• replace-words
• replace-yarn-with-npm
• reservoir-sampling
• restore-ip-addresses
• reuse-semantic-release
• reverse-linked-list
• rotate-list
• rotated-digits
• same-tree
• search-a-2d-matrix-ii
• search-in-rotated-sorted-array-ii
• sequence-reconstruction
• sequence-reconstruction-bfs
• serialize-and-deserialize-binary-tree
• serialize-and-deserialize-bst
• setup-vsc-debugger
• shortest-completing-word
• simplify-tree-serialization
• sliding-window-maximum
• sort-tree-problems
• sparse-matrix-multiplication
• split-linked-list-in-parts
• stock-cooldown
• stock-fee
• stock-ii
• stock-iii
• stock-iv
• subarray-sum-equals-k
• subsets
• subsets-ii
• subtree-of-another-tree
• sudoku-solver
• sum-root-to-leaf-numbers
• symmetric-tree
• task-scheduler
• test-single-file
• text-justification
• the-maze-ii
• the-skyline-problem
• tiny-url
• toeplitz-matrix
• top-k-frequent-words
• trim-a-binary-search-tree
• try-corp-semantic-release
• unique-binary-search-trees-ii
• univalue-tree
• update-babel-plugin-module-resolver
• update-closest-node-in-bst
• update-cover
• update-debugger
• update-lca-readme
• update-package
• update-release
• update-release-script
• upgrade-2018-06-19
• upgrade-node-version
• use-priority-queue
• v1.1.0
• v1.2.2
• v1.69.1
• v1.69.2
• v1.69.3
• v1.70.0
• v1.71.0
• v2.0.0
• v2.0.1
• valid-palindrome-ii
• valid-parentheses
• valid-triangle-number
• valid-word-square
• validate-bst
• verify-preorder-sequence-in-binary-search-tree
• wildcard-matching
• word-break
• word-break-ii
• word-ladder
• word-ladder-ii
• word-search
• word-search-ii
• word-squares

Build # 776

Build Type

push

travis-ci

Committed by jeantimex

Commit Message

Kth Smallest Element in a BST

Run Details

1254 of 1254 branches covered (100.0%)

Branch coverage included in aggregate %.

2847 of 2847 relevant lines covered (100.0%)

1118.74 hits per line