---
tag: GNTE1J147Z
kind: concept
name: k-ary
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section A
    note: adopted
    mention: wikipedia://en/325802#4H89
    sections: [Summary]
inventory: [VNVNYJX3QC]
---

## Summary

A $k$-ary tree is a rooted tree in which every internal vertex has no more than $k$ children. A 1-ary tree is just a path. A 2-ary tree is also called a [[binary tree|02A8EMC83C]], although that term more properly refers to 2-ary trees in which the children of each node are distinguished as being left or right children (with at most one of each type). A $k$-ary tree is said to be complete if every internal vertex has exactly $k$ children.