File tree Expand file tree Collapse file tree 3 files changed +5
-2
lines changed
main/java/by/andd3dfx/tree
test/java/by/andd3dfx/tree Expand file tree Collapse file tree 3 files changed +5
-2
lines changed Original file line number Diff line number Diff line change @@ -249,7 +249,8 @@ they contain enough code which describes implementation in a natural way.
249
249
| Java интервью 11 | [ Youtube] ( https://youtu.be/zufbVgdBCAI ) | - |
250
250
| Java интервью 12 | [ Youtube] ( https://youtu.be/PD41epg_pT4 ) | - |
251
251
| Функциональные тесты REST API с помощью Spock | [ Youtube] ( https://youtu.be/GK5y3oA3qfM ) | - |
252
- | Вычисление квадратного корня вавилонским методом (leetcode) | [ Youtube] ( https://youtu.be/41zAzebmOuc ) | [ Code] ( src/main/java/by/andd3dfx/numeric/SquareRootBabylon.java ) |
252
+ | Вавилонский метод вычисления квадратного корня (leetcode) | [ Youtube] ( https://youtu.be/41zAzebmOuc ) | [ Code] ( src/main/java/by/andd3dfx/numeric/SquareRootBabylon.java ) |
253
+ | Определение высоты бинарного дерева | [ Youtube] ( https://youtu.be/xTftgqH0WVI ) | [ Code] ( src/main/java/by/andd3dfx/tree/TreeHeight.java ) |
253
254
254
255
## Materials & notes
255
256
Original file line number Diff line number Diff line change 4
4
5
5
/**
6
6
* Determine height/depth of binary tree
7
+ *
8
+ * @see <a href="https://youtu.be/xTftgqH0WVI">Video solution</a>
7
9
*/
8
10
public class TreeHeight {
9
11
Original file line number Diff line number Diff line change @@ -12,7 +12,7 @@ public class TreeHeightTest {
12
12
public void testCalcHeight () {
13
13
var two = new Node (2 );
14
14
var three = new Node (3 , new Node (4 ), null );
15
- Node root = new Node (1 , two , three );
15
+ var root = new Node (1 , two , three );
16
16
17
17
assertThat (calcHeight (root )).isEqualTo (3 );
18
18
assertThat (calcHeight (two )).isEqualTo (1 );
You can’t perform that action at this time.
0 commit comments