We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 94fbf42 commit 1193cbdCopy full SHA for 1193cbd
2-ui/1-document/07-modifying-document/8-tree-count/task.md
@@ -4,10 +4,10 @@ importance: 5
4
5
# Show descendants in a tree
6
7
-There's a tree organized as nested `ul/li`.
+`ul/li` olarak iç içe geçmiş birağaç var.
8
9
-Write the code that adds to each `<li>` the number of its descendants. Skip leaves (nodes without children).
+Her bir "<li>" nin neslindenn gelenlerin sayısını ekleyen kodu yazın. Yaprakları geçin (çocuksuz düğümler).
10
11
-The result:
+Sonuç:
12
13
[iframe border=1 src="solution"]
0 commit comments