-
**Problems / Exercises:** 15.1, 15.2, 15.3, 15.4, 15.5, 15.8, 15.9
- [x] 15.1 Working Solution
- [x] 15.2 Working Solution
- [x] 15.3 Working Solution
- [ ] 15.4 Working Solution
- [ ] 15.5…
-
> Because the merkle tree is a binary tree, it needs an even number of leaf nodes. If there is an odd number of transactions to summarize, the last transaction hash will be duplicated to create an eve…
-
## [617. Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)
给定两个二叉树,想象当你将它们中的一个覆盖到另一个上时,两个二叉树的一些节点便会重叠。
你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠,那么将他们的值相加作为节点合并后的新值,否则不为 __NUL…
-
## [96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)
给定一个整数 `n`,求以 `1 ... n` 为节点组成的二叉搜索树有多少种?
#### Example
```text
Input: 3
Output: 5
Explanation:…
-
![image](https://user-images.githubusercontent.com/32625059/66123141-edce5400-e613-11e9-8cea-b5772ca4b8b2.png)
-
Contribution Guidelines for this question
-Languages available: C++, Java, Python
-Well Commented Code
-In the starting, add a brief explanation of the algorithm
-if possible, add time and space…
-
# Contribution Guidelines for this question-
- Languages available: C++, Java, Python
- Well Commented Code
- In the starting, add a brief explanation of the algorithm
- if possible, add time an…
-
Hi, just asking, is it possible to draw diagrams like these:
https://en.wikipedia.org/wiki/Binary_search_tree
I'm more used to graphviz-style syntax whereas it seems flowchart.js and the other UML s…
-
https://leetcode.com/problems/merge-two-binary-trees/
link to the problem
-
The naive diploid Viterbi algorithm doesn't scale well with the number of reference haplotypes, slowing testing (#65). @astheeggeggs suggested an alternative implementation that "merges" partial ances…