Left-child right-sibling binary tree
(重定向自Doubly chained tree)
![[1]](/uploads/202501/09/The_binary_tree3932.jpeg)


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.