ternary tree (Q7263850)

From Wikidata
Jump to navigation Jump to search
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"
  • 3-ary tree
edit
Language Label Description Also known as
English
ternary tree
tree data structure in which each node has at most three child nodes, usually distinguished as "left", “mid” and "right"
  • 3-ary tree

Statements

0 references
0 references
0 references
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit