{"request":{"endpoint":"https://exercism.org/api/v2/tracks/prolog/exercises/binary-search-tree/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"3cf910bccc1d44d6a4bb78de115eae25","snippet":"add(X, tree_node(Y, L, R), tree_node(Y, L, R0)) :- X > Y, add(X, R, R0), !. add(X, tree_node(Y, L, R), tree_node(Y, L0, R)) :- add(X, L, L0), !. add(X, nil, tree_node(X, nil, nil)). add([], nil). add([X|Xs], Tree) :- add(Xs, Tree0), add(X, Tree0, Tree). from_data(Data, Tree) :- reverse(Data, Xs), add(Xs, Tree). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-10T00:37:24.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"gumminoppe"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/gumminoppe","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"8a79f6fb78dc4df1acd29b027c20b142","snippet":"insert(Data, nil, tree_node(Data, nil, nil)) :- !. insert(Data, tree_node(TreeData, Left, Right), NewTree) :- (Data =< TreeData -> insert(Data, Left, NewLeft), NewTree = tree_node(TreeData, NewLeft, Right); insert(Data, Right, NewRight), NewTree = tree_node(TreeData, Left, NewRight)). from_data(Data, Tree) :- foldl(insert, Data, nil, Tree). to_data(nil, []). to_data(tree_node(TreeData, Left, Right), Data) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-27T12:41:28.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"08c43a3d1b0d4855bdc527a75adbfa04","snippet":"% from_data(Data, Tree). % to_data(Tree, Data). from_data(Data, Tree):- msort(Data, D), to_data(Tree, D). to_data(nil, []). to_data(tree_node(Label, Left, Right), Data):- length(Data, L), L > 0, L2 is L div 2, length(List1, L2), append(List1, [Label|List2], Data), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-05-02T11:10:43.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"enkire"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/enkire","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"a1855ef1089849b1ae46c10bb26d29d1","snippet":"add(N, nil, tree_node(N, nil, nil)). add(N, tree_node(M, A, B), tree_node(M, X, Y)) :- N > M -> X = A, add(N, B, Y); Y = B, add(N, A, X). from_data(Data, Tree) :- foldl(add, Data, nil, Tree). to_data(Tree, Data) :- to_data(Tree, Data, []). to_data(nil, L, L). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":8,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-19T21:36:37.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"anseok"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/anseok","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"d7113cdc5a9443cbad9f7f834a077d84","snippet":"%from_data(+Values, -Node) from_data([Value|RestValues], Tree) :- RootNode = tree_node(Value, nil, nil), insert_values(RootNode, RestValues, Tree). %insert_values(+Tree, +ValueList, -ResultTree) insert_values(Tree, [Value|Values], ResultTree) :- !, insert_value(Tree, Value, NewTree), insert_values(NewTree, Values, ResultTree). insert_values(Tree, [], Tree). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-06-18T16:16:15.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AndrasLengyel"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/AndrasLengyel","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"bcdeff77cd244a1790a2de48ea8881bf","snippet":"% binary_search_tree.pl % Binary search tree implementation with insert and in-order traversal from_data(List, Tree) :- foldl(insert, List, nil, Tree). insert(Value, nil, tree_node(Value, nil, nil)). insert(Value, tree_node(Root, Left, Right), tree_node(Root, NewLeft, Right)) :- Value =< Root, !, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-18T01:01:07.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kenokabe"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/kenokabe","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"5e4e4cb527374684bc7b0a19b2fc6b2e","snippet":"from_data( Data , Tree ) :- crea_ABB( Data , Tree ). crea_ABB( [ ] , nil ). crea_ABB( [ Elem ] , tree_node( Elem , nil , nil ) ). crea_ABB( [ Cabeza | Resto ] , tree_node( Cabeza , ArbolI , ArbolD ) ) :- divideLista( Resto , Cabeza , Mayores , Menores ), crea_ABB( Menores , ArbolI ), crea_ABB( Mayores , ArbolD ). divideLista( [ ] , _ , [ ] , [ ] ). divideLista( [ Cabeza | Resto ] , N , Mayores , [ Cabeza | Menores ] ) :- Cabeza =< N, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-22T12:23:21.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AlexisRojasUHU"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/AlexisRojasUHU","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"c13274bd9eb440e9920acd92fda7d554","snippet":"insert(K, Node) :- Node = tree_node(V, A, B), NewNode = tree_node(K, nil, nil), ( K =< V -> ( A == nil -> setarg(2, Node, NewNode); insert(K, A)) ; ( B == nil -> setarg(3, Node, NewNode); insert(K, B)) ). from_data([H|T], Tree) :- Tree = tree_node(H, nil, nil), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-08-28T11:40:15.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"HitlerNaziGermany"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/HitlerNaziGermany","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"31102e3027c4495a8ed71fccc5c4aed3","snippet":"create_tree(Number, tree_node(Number, nil, nil)). insert(Number, tree_node(Curr, nil, R), tree_node(Curr, tree_node(Number, nil, nil), R)) :- Number =< Curr, !. insert(Number, tree_node(Curr, L, nil), tree_node(Curr, L, tree_node(Number, nil, nil))) :- Number > Curr, !. insert(Number, tree_node(Curr, Left, Right), tree_node(Curr, NewLeft, Right)) :- Number =< Curr, insert(Number, Left, NewLeft), !. insert(Number, tree_node(Curr, Left, Right), tree_node(Curr, Left, NewRight)) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-03-05T11:27:28.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"codebr3aker"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/codebr3aker","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"0daeb65ba0314598bcaf784801c4e740","snippet":"from_data(Datos, Arbol) :- crear_arbol(Datos, nil, Arbol). crear_arbol([], Arbol, Arbol). crear_arbol([Cabeza|Resto], ArbolActual, ArbolFinal) :- insertar(Cabeza, ArbolActual, NuevoArbol), crear_arbol(Resto, NuevoArbol, ArbolFinal). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-14T18:55:21.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Alejandro-Hurtado"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/Alejandro-Hurtado","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"aad90f1657404112862749db7fec827e","snippet":"%base case: empty list -> nil from_data([], nil). from_data([Head|Tail], Tree):- insert_list(Tail, tree_node(Head, nil, nil), Tree).% create Root and pass to insert Rest into Tree(just the root) %base case: stop insertion when the list is empty insert_list([], Tree, Tree). insert_list([Head|Tail], Tree, Res):- insert_node(Head, Tree, NewTree), % inser one value to the tree ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-06-09T09:22:58.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"TarekDeek16"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/TarekDeek16","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"4c1f9c5e45684899b0128e59e56133b9","snippet":":- use_module(library(dcg/basics)). node_p(nil) --> []. node_p(tree_node(V, L, R)) --> node_p(L), [V], node_p(R). from_data(Data, Tree) :- build_tree(Data, nil, Tree). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-11-24T04:00:09.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kkweon"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/kkweon","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"dd08bbd7b65b482dbbb7f1aef6983f0c","snippet":"from_data(Data, Tree) :- foldl(from_data, Data, nil, Tree). from_data(Value, nil, tree_node(Value, nil, nil)) :- !. from_data(Value, tree_node(X, Left, Right), Tree) :- ( Value =< X -> Tree = tree_node(X, Left0, Right), from_data(Value, Left, Left0) ; Tree = tree_node(X, Left, Right0), from_data(Value, Right, Right0) ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-25T20:09:36.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"stellartux"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/stellartux","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"918d1728d7844089864eb5323c0edf71","snippet":"insert_node(Val, nil, Result):- Result = tree_node(Val, nil, nil), !. insert_node(Val, tree_node(Node_Val, Left, Right), Result):- (Val =< Node_Val -> insert_node(Val, Left, NewLeft), Result = tree_node(Node_Val, NewLeft, Right ); insert_node(Val, Right, NewRight), Result = tree_node(Node_Val, Left, NewRight ) ). from_data(List, Tree):- foldl(insert_node, List, nil, Tree). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-27T10:42:01.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"DimitarIvanov7"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/DimitarIvanov7","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"cc6800ff7e294aae8060f1d662bb633d","snippet":"from_data(D, A):- msort(D, DS), to_data(A, DS). from_data(D, A) :- from_data(D, nil, A). from_data([], A, A). from_data([C|Resto], A, R2) :- insertar(A, C, R1), from_data(Resto, R1, R2). to_data(nil, []). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-14T19:47:56.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"GMAMG447"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/GMAMG447","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"f17bfa895ea043d4a2ee56a11a3a5133","snippet":"from_data([], nil). from_data(LE, AB):- aniade_todos(LE, AB, nil). aniade_todos([], AB, AB). aniade_todos([C|R], AB, Aux):- aniade(C, Aux, Naux), aniade_todos(R, AB, Naux). aniade(C, nil, tree_node(C, nil, nil)). aniade(C, tree_node(R, HI, HD), tree_node(R, NewHI, HD)):- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-15T10:17:15.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Juanpramo"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/Juanpramo","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"f4780aeb131c43919e68d4ffc327de6e","snippet":"from_data(Lista, Tree):- construir_bst(Lista, nil, Tree). construir_bst([], Arbol, Arbol). construir_bst([C|Resto], ArbolActual, ArbolFinal):- insertar(C, ArbolActual, NuevoArbol), construir_bst(Resto, NuevoArbol, ArbolFinal). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-04-22T10:43:17.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"rubencq26"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/rubencq26","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"63f0f854cad249da8e53aa8cacd22c04","snippet":"% from_data(Data, Tree). % to_data(Tree, Data). from_data(Lista,Arbol) :- from_data_aux(Lista,nil,Arbol). from_data_aux([],A,A). from_data_aux([Cab|Res],ArbActual,ArbCompleto) :- insertar(Cab,ArbActual,Arbol1), from_data_aux(Res,Arbol1,ArbCompleto). insertar(X, nil, tree_node(X,nil,nil)). insertar(X, tree_node(Y,A,B),tree_node(Y,R,B)) :- X =< Y, insertar(X,A,R). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-05-28T16:41:53.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Elisammc"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/Elisammc","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"98d39e98f5ec4ea5bc410bb108f1a824","snippet":"from_data(Lista, Tree) :- from_data_acc(Lista, nil, Tree). from_data_acc([], Acum, Acum). from_data_acc([Cab|Resto], Acum, Tree) :- insert(Acum, Cab, NuevoAcum), from_data_acc(Resto, NuevoAcum, Tree). insert(nil, X, tree_node(X, nil, nil)). insert(tree_node(Valor, Izq, Der), X, tree_node(Valor, NuevoIzq, Der)) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-06-12T15:22:22.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"norbertogarcia"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/norbertogarcia","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"f92e77c8d2b44857a11a8cef00febb9e","snippet":"%from_data(Data, Tree). insert(nil, X, tree_node(X, nil, nil)). insert(tree_node(Dato, Izq, Der), X, tree_node(Dato, NuevaIzq, Der)) :- X =< Dato, insert(Izq, X, NuevaIzq). insert(tree_node(Dato, Izq, Der), X, tree_node(Dato, Izq, NuevaDer)) :- X > Dato, insert(Der, X, NuevaDer). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-14T19:02:09.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AntonioDePadua-Rodriguez"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/AntonioDePadua-Rodriguez","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"2d60a80f96d54c639b8ccc0cc4971827","snippet":"% Blessed to Shree DR.MDD — My Eternal Strength & Source of Light insert(Item, nil, tree_node(Item, nil, nil)) :- !. insert(Item, tree_node(RootVal, LBranch, RBranch), UpdatedTree) :- (Item =< RootVal -> insert(Item, LBranch, NewLBranch), UpdatedTree = tree_node(RootVal, NewLBranch, RBranch); insert(Item, RBranch, NewRBranch), UpdatedTree = tree_node(RootVal, LBranch, NewRBranch)). from_data(List, OutputTree) :- foldl(insert, List, nil, OutputTree). to_data(nil, []). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-26T19:15:01.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Rohankapri"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/Rohankapri","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"5d352d15e0df4ff6bdb6d3b074c6b018","snippet":"from_data(Data, Tree) :- foldl(insert, Data, nil, Tree). insert(X, nil, tree_node(X,nil,nil)). insert(X, tree_node(Y,Left0,Right0), Tree) :- ( X =< Y -> insert(X, Left0, Left), Tree = tree_node(Y,Left,Right0) ; insert(X, Right0, Right), Tree = tree_node(Y,Left0,Right) ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-22T00:39:34.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"jinwoo"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/jinwoo","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"9972e2e4438b477e91cc192c1a0eb713","snippet":"from_data(Data, Tree):- from_data(Data, nil, Tree). from_data([], Tree, Tree). from_data([Cab|Resto], Act, Tree):- insertar(Cab, Act, NuevoAct), from_data(Resto, NuevoAct, Tree). insertar(X, nil, tree_node(X, nil, nil)). insertar(X, tree_node(Raiz, Izq, Der), tree_node(Raiz, NuevoIzq, Der)) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-04-22T10:54:08.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AleMdP"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/AleMdP","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}},{"uuid":"35396eb1f12842fcbf0a2d9df824843f","snippet":"insert(X, nil, tree_node(X, nil, nil)) :- !. insert(X, tree_node(Y, L, R), tree_node(Y, L2, R)) :- X =< Y, !, insert(X, L, L2). insert(X, tree_node(Y, L, R), tree_node(Y, L, R2)) :- X > Y, insert(X, R, R2). from_data(Data, Tree) :- foldl(insert, Data, nil, Tree). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-08T19:32:53.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"punkstarman"},"exercise":{"title":"Двійкове дерево пошуку","icon_url":"https://assets.exercism.org/exercises/binary-search-tree.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/solutions/punkstarman","private_iterations_url":"https://exercism.org/uk/tracks/prolog/exercises/binary-search-tree/iterations"}}],"meta":{"current_page":1,"total_count":29,"total_pages":2,"unscoped_total":29}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери