Left-child right-sibling binary tree
（重定向自Doubly chained tree）
![[1]](/Images/godic/202501/09/The_binary_tree3932.jpeg")
![6-ary tree represented as a binary tree](/Images/godic/202501/09/N-ary_to_binary.svg3932.png")
![A trie implemented as a doubly chained tree: vertical arrows are child pointers, dashed horizontal arrows are next-sibling pointers. Tries are edge-labeled, and in this representation the edge labels become node labels on the binary nodes.](/Images/godic/202501/09/Pointer_implementation_of_a_trie.svg3932.png")
A way to represent a multiway or k-ary tree is as a binary tree. The left side of node is called a child – a specific node is one of the nodes to which it points, in the next level down on the tree, the next child node is called a sibling – like a human child it has the same parent as the other child.