See drzewo binarne in All languages combined, or Wiktionary
{
"categories": [
{
"kind": "other",
"name": "Polski (indeks)",
"orig": "polski (indeks)",
"parents": [],
"source": "w"
}
],
"forms": [
{
"form": "drzewa binarnego",
"sense_index": "1.1",
"tags": [
"genitive",
"singular"
]
},
{
"form": "drzewu binarnemu",
"sense_index": "1.1",
"tags": [
"dative",
"singular"
]
},
{
"form": "drzewem binarnym",
"sense_index": "1.1",
"tags": [
"instrumental",
"singular"
]
},
{
"form": "drzewie binarnym",
"sense_index": "1.1",
"tags": [
"locative",
"singular"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"nominative",
"plural"
]
},
{
"form": "drzew binarnych",
"sense_index": "1.1",
"tags": [
"genitive",
"plural"
]
},
{
"form": "drzewom binarnym",
"sense_index": "1.1",
"tags": [
"dative",
"plural"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"accusative",
"plural"
]
},
{
"form": "drzewami binarnym",
"sense_index": "1.1",
"tags": [
"instrumental",
"plural"
]
},
{
"form": "drzewach binarnych",
"sense_index": "1.1",
"tags": [
"locative",
"plural"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"vocative",
"plural"
]
}
],
"hypernyms": [
{
"sense_index": "1.1",
"word": "drzewo"
}
],
"lang": "język polski",
"lang_code": "pl",
"pos": "noun",
"pos_text": "rzeczownikowa",
"senses": [
{
"examples": [
{
"bold_text_offsets": [
[
0,
14
]
],
"ref": "Niklaus Wirth, Algorytmy + struktury danych = programy, Wydawnictwa Naukowo-Techniczne, Warszawa 1989, ISBN 83-204-1120-3, s. 213.",
"text": "Drzewa binarne są często stosowane do reprezentowania zbioru danych, którego elementy mają być wybierane za pomocą identyfikującego je klucza"
}
],
"glosses": [
"spójny graf acykliczny (drzewo) którego każdy wierzchołek ma co najwyżej trzy wierzchołki incydentne (rodzica i dwóch potomków)"
],
"id": "pl-drzewo_binarne-pl-noun-b13LZaR7",
"sense_index": "1.1",
"topics": [
"computer-science",
"mathematics"
]
}
],
"tags": [
"neuter"
],
"translations": [
{
"lang": "angielski",
"lang_code": "en",
"sense_index": "1.1",
"word": "binary tree"
},
{
"lang": "czeski",
"lang_code": "cs",
"sense_index": "1.1",
"tags": [
"masculine"
],
"word": "binární strom"
},
{
"lang": "hiszpański",
"lang_code": "es",
"sense_index": "1.1",
"tags": [
"masculine"
],
"word": "árbol binario"
},
{
"lang": "nowogrecki",
"lang_code": "el",
"sense_index": "1.1",
"tags": [
"neuter"
],
"word": "δυαδικό δέντρο"
}
],
"word": "drzewo binarne"
}
{
"categories": [
"polski (indeks)"
],
"forms": [
{
"form": "drzewa binarnego",
"sense_index": "1.1",
"tags": [
"genitive",
"singular"
]
},
{
"form": "drzewu binarnemu",
"sense_index": "1.1",
"tags": [
"dative",
"singular"
]
},
{
"form": "drzewem binarnym",
"sense_index": "1.1",
"tags": [
"instrumental",
"singular"
]
},
{
"form": "drzewie binarnym",
"sense_index": "1.1",
"tags": [
"locative",
"singular"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"nominative",
"plural"
]
},
{
"form": "drzew binarnych",
"sense_index": "1.1",
"tags": [
"genitive",
"plural"
]
},
{
"form": "drzewom binarnym",
"sense_index": "1.1",
"tags": [
"dative",
"plural"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"accusative",
"plural"
]
},
{
"form": "drzewami binarnym",
"sense_index": "1.1",
"tags": [
"instrumental",
"plural"
]
},
{
"form": "drzewach binarnych",
"sense_index": "1.1",
"tags": [
"locative",
"plural"
]
},
{
"form": "drzewa binarne",
"sense_index": "1.1",
"tags": [
"vocative",
"plural"
]
}
],
"hypernyms": [
{
"sense_index": "1.1",
"word": "drzewo"
}
],
"lang": "język polski",
"lang_code": "pl",
"pos": "noun",
"pos_text": "rzeczownikowa",
"senses": [
{
"examples": [
{
"bold_text_offsets": [
[
0,
14
]
],
"ref": "Niklaus Wirth, Algorytmy + struktury danych = programy, Wydawnictwa Naukowo-Techniczne, Warszawa 1989, ISBN 83-204-1120-3, s. 213.",
"text": "Drzewa binarne są często stosowane do reprezentowania zbioru danych, którego elementy mają być wybierane za pomocą identyfikującego je klucza"
}
],
"glosses": [
"spójny graf acykliczny (drzewo) którego każdy wierzchołek ma co najwyżej trzy wierzchołki incydentne (rodzica i dwóch potomków)"
],
"sense_index": "1.1",
"topics": [
"computer-science",
"mathematics"
]
}
],
"tags": [
"neuter"
],
"translations": [
{
"lang": "angielski",
"lang_code": "en",
"sense_index": "1.1",
"word": "binary tree"
},
{
"lang": "czeski",
"lang_code": "cs",
"sense_index": "1.1",
"tags": [
"masculine"
],
"word": "binární strom"
},
{
"lang": "hiszpański",
"lang_code": "es",
"sense_index": "1.1",
"tags": [
"masculine"
],
"word": "árbol binario"
},
{
"lang": "nowogrecki",
"lang_code": "el",
"sense_index": "1.1",
"tags": [
"neuter"
],
"word": "δυαδικό δέντρο"
}
],
"word": "drzewo binarne"
}
Download raw JSONL data for drzewo binarne meaning in język polski (2.2kB)
This page is a part of the kaikki.org machine-readable język polski dictionary. This dictionary is based on structured data extracted on 2025-04-13 from the plwiktionary dump dated 2025-04-03 using wiktextract (aeaf2a1 and fb63907). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.