# Advent of Kotlin Week 2: Tree algorithms

DevFeed: [Advent of Kotlin Week 2: Tree algorithms](<https://devfeed.tech/articles/advent-of-kotlin-week-2-39191.md>)

Original publisher: [Read original article](<https://kt.academy/article/advent-2021-week2>)

Published: 2021-12-06T00:00:00Z

Content type: tutorial

Language: en

Sources: [Kt. Academy](<https://devfeed.tech/sources/kt-academy.md>)

Topics: [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Kotlin](<https://devfeed.tech/topics/kotlin.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [developer](<https://devfeed.tech/tags/developer.md>), [kotlin](<https://devfeed.tech/tags/kotlin.md>), [programming](<https://devfeed.tech/tags/programming.md>), [workshop-learning-programming](<https://devfeed.tech/tags/workshop-learning-programming.md>)

## AI overview

Week 2 of the Advent of Kotlin focuses on tree algorithms, including counting leaves and nodes, finding tree height and maximum elements, summing values, searching for a value, combining trees, and converting a tree to a list.

## Source excerpt

Week 2 of the Advent of Kotlin: Tree algorithms