8.1 树基础

树是一类递归结构, 一个树包含一个根节点及其若干子节点, 而每个子节点也包含若干个子节点. 若子节点没有子节点那么就称为叶节点.

二叉树是一类比较常见的树, 其子节点最多有两个.

In computer science, a binary tree is a k-ary (k=2) tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

Reference

1. 剑指Offer（专项突破版）
2. Binary Trees wiki