にぶんぎ
二分木
1. binary treeComputing
2. Binary treeIn computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child.
Read “Binary tree” on English Wikipedia
Read “二分木” on Japanese Wikipedia
Read “Binary tree” on DBpedia
Read “Binary tree” on English Wikipedia
Read “二分木” on Japanese Wikipedia
Read “Binary tree” on DBpedia
Discussions
Log in to talk about this word.