{"request":{"endpoint":"https://exercism.org/api/v2/tracks/kotlin/exercises/binary-search-tree/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"97b3e42ea0be458c8947bbd8366bbe0b","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node?, var right: Node?) var root: Node? = null fun insert(value: T) { root = insertHelper(value, root) } ","num_views":0,"num_stars":3,"num_comments":0,"representation_num_published_solutions":38,"num_iterations":1,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-03-11T08:30:33.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"annalisetarhan"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/annalisetarhan","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"eb6401064b1e4d80a3b48942e206de7e","snippet":"import java.util.SortedMap class BinarySearchTree> { data class Node(val data: T, val left: Node? = null, val right: Node? = null) var root: Node? = null fun insert(value: T) { root = root?.insert(value) ?: Node(value) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":24,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-09-11T08:13:26.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"lotharschulz"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/lotharschulz","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"f84f49354d314e49a4f9fab0fa64aae9","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { if (root == null) { root = Node(value) } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-02-28T16:15:02.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"lathspell"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/lathspell","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"c0d9ce2363bb4f8d9626b9d5bcfcf1b5","snippet":"class BinarySearchTree> { data class Node>(val data: T) { var left: Node? = null var right: Node? = null fun insert(value: T) { if (value > data) { when (right) { null -> right = Node(value) else -> right!!.insert(value) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":53,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-04-01T14:07:52.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"uzilan"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/uzilan","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"07fc099fa7214a0d8724a20517e50156","snippet":"class BinarySearchTree> { data class Node( val data: T, var left: Node? = null, var right: Node? = null ) var root: Node? = null private set ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":55,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-08-13T18:05:59.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"MoreStrive"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/MoreStrive","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"6ab46fc8b07340a08e9755ad8afe5555","snippet":"import kotlin.math.sign class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { root?.let { findNode(it, value).push(value) } ?: run { root = Node(value) } ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-07-25T20:19:10.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"aneroid"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/aneroid","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"7232a62faf0c4dba872ac933c1a84c78","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { root = insertRecursive(root, value) } fun asSortedList(): List { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-11T12:57:53.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"MarioHBS"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/MarioHBS","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"b4db4060e7224c64a153778be5e3d590","snippet":"class BinarySearchTree> { data class Node( val data: T, var left: Node? = null, var right: Node? = null ) var root: Node? = null ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":45,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-05-31T09:15:18.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"Ngoc-Trong2211"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/Ngoc-Trong2211","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"e78668d9c9f2436ba430e5828b1a9f6a","snippet":"class BinarySearchTree> { data class Node>( val data: T, var left: Node? = null, var right: Node? = null ) { fun insert(data: T): Node { when { data <= this.data -> left = left?.insert(data) ?: Node(data) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":40,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-20T18:37:19.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"glennj"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/glennj","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"0e741ece630443a9aa2d693032e85859","snippet":"import java.util.* class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) { fun insert(dataToInsert: T) { when { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-06-03T15:41:16.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"rafal-a"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/rafal-a","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"caf1346202904d48aaee8a8b7fa3646d","snippet":"import java.util.* class BinarySearchTree> { var root: Node? = null fun insert(value: T) { root = insert(value, root) } fun asSortedList(): List = mutableListOf().apply { inOrder(root) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":35,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-05-15T15:14:50.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"emiliolg"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/emiliolg","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"d7d84b3f16524b5783e81304201bc036","snippet":"import java.util.* class BinarySearchTree> { data class Node(var data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { if (root == null) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-26T16:09:27.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"dugrimov"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/dugrimov","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"3e7543f32af1495890d6b941f264db8c","snippet":"import java.lang.Integer.max class BinarySearchTree> { data class Node>(val data: T, var left: Node? = null, var right: Node? = null) { fun toList(): List = listOfNotNull(left?.toList(), listOf(data), right?.toList()).flatten() fun toLevelOrderList(): List> { val left = left?.toLevelOrderList() ?: emptyList() val right = right?.toLevelOrderList() ?: emptyList() ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-02-01T15:34:42.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"davidjoeressen"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/davidjoeressen","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"0bcfedf956024b08b6aa64d50f1b2120","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { if (root == null) { root = Node(value) return ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-31T17:16:02.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"hsalah"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/hsalah","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"05f926a45c544afb81aa91ec0ba961c2","snippet":"import java.lang.Integer.max class BinarySearchTree> { data class Node>(val data: T, var left: Node? = null, var right: Node? = null) { fun insert(value: T) { when { value <= data -> if(left == null) left = Node(value) else left!!.insert(value) value > data -> if(right == null) right = Node(value) else right!!.insert(value) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-06-26T15:51:41.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"lplath"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/lplath","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"9a4f78a39a074bda9f33fc72e590b171","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null private tailrec fun insertAtNode(node: Node, value: T): Unit = when { value <= node.data -> when (node.left) { null -> node.left = Node(value) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-04-04T19:21:10.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"mikemcgowan"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/mikemcgowan","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"4957c20a249447888a55c81383be5adc","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { fun insert(node: Node?): Node? { if (node == null) { return Node(value) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-05T05:34:19.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"fredyw"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/fredyw","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"4b2b3d2aac684227be0e84518a511ac5","snippet":"import java.util.LinkedList import java.util.Queue class BinarySearchTree> { data class Node(val data: T, var right: Node?, var left: Node?) var root: Node? = null var insertControl: Boolean = true var sortedList: List = listOf() ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":59,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-03-28T13:30:44.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"lourencolucio-4261"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/lourencolucio-4261","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"f9bf66d9fdea4f849060730aabd9a785","snippet":"class BinarySearchTree> { data class Node>(val data: J, var left: Node? = null, var right: Node? = null) { fun insert(value: J) { if (value <= data) when (left) { null -> left = Node(value) else -> left?.insert(value) } else when (right) { null -> right = Node(value) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":34,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-12T20:02:04.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"lsoares"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/lsoares","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"e099d38546db474bb2eff6ca0589e19d","snippet":"import java.util.* class BinarySearchTree> { data class Node(val data: T, var left: Node?, var right: Node?) var root: Node? = null fun insert(value: T) { fun insert(currentNode: Node?): Node { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-12T12:55:27.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"ndani14"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/ndani14","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"fdf6d37af22e41bba0d1035279c4f036","snippet":"class BinarySearchTree> { data class Node>(val data: T) { var left: Node? = null private set var right: Node? = null private set fun insert(value: T) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":7,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-24T15:00:31.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"eloipoch"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/eloipoch","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"769b5086411d41a69172bebefd9ecbf0","snippet":"class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T) { if (root == null) root = Node(value) else { var node = root ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":51,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-06T02:10:36.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"RazielO"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/RazielO","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"aa307677d72241b1864e46728adebd09","snippet":"import java.util.LinkedList class BinarySearchTree> { data class Node( val data: T, var left: Node? = null, var right: Node? = null, ) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-09T15:31:19.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"marcusschroeder"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/marcusschroeder","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}},{"uuid":"aac4a30fc9cd4527be552d73e7a8b459","snippet":"import java.util.Queue import java.util.LinkedList class BinarySearchTree> { data class Node(val data: T, var left: Node? = null, var right: Node? = null) var root: Node? = null fun insert(value: T, node: Node? = root) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-23T21:37:16.000Z","is_out_of_date":false,"language":"kotlin","author":{"handle":"tonio337"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Kotlin","icon_url":"https://assets.exercism.org/tracks/kotlin.svg","highlightjs_language":"kotlin"},"links":{"public_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/solutions/tonio337","private_iterations_url":"https://exercism.org/uk/tracks/kotlin/exercises/binary-search-tree/iterations"}}],"meta":{"current_page":1,"total_count":120,"total_pages":5,"unscoped_total":120}}}}}

Мовні треки

Вчимося програмувати з Jiki

Подорож

ОбранеНове

Переваги Exercism

Відео спільноти

Серія коротких вступів

Інтервʼю та історії

Discord

Форум

З чого почати

Наставництво

Документація

Учасники

ПерекладачіНове

Пожертвувати

Про Exercism

Наш вплив

Синхронізатор GitHubНове

Інсайдери