📚 Mastering Trees for A-Level Edexcel Computer Science | A-Level Edexcel 计算机：树 考点精讲
A tree is a fundamental non-linear data structure that organises data in a hierarchical way. For Edexcel A-Level Computer Science, you need to understand tree terminology, binary trees, binary search trees, tree traversals, heaps, expression trees, and their real-world applications. This article breaks down every essential concept, pairing clear English explanations with Mandarin versions to help you master the topic and tackle exam questions with confidence.
树是一种基础的非线性数据结构，以层次化方式组织数据。对于 Edexcel A-Level 计算机课程，你需要掌握树的术语、二叉树、二叉搜索树、树的遍历、堆、表达式树以及它们的实际应用。本文拆解每一个核心概念，用清晰的英文解释和中文对应，帮助各位彻底掌握该主题，自信应对考试。
1. Tree Terminology | 树的基本术语
A tree consists of nodes connected by edges. The topmost node is called the root. Every node (except the root) has exactly one parent, and can have zero or more child nodes. Nodes with no children are called leaves. A subtree is a smaller tree formed by any node and all its descendants. The depth of a node is the number of edges from the root to that node; the height of a node is the longest path from that node to a leaf. The height of the tree is the height of the root.
树由节点和连接节点的边组成。最顶层的节点称为根。每个节点（根除外）都恰好有一个父节点，可以有零个或多个子节点。没有子节点的节点称为叶节点。子树是由任意节点及其所有后代构成的小型树。节点的深度是从根到该节点的边数；节点的高度是从该节点到叶节点的最长路径。树的高度就是根节点的高度。
- Root, parent, child, sibling, leaf, edge, path – all describe relationships within the tree.
- 根、父、子、兄弟、叶、边、路径——都描述树内的关系。
- Depth (distance from root) and height (distance to deepest leaf) are used to measure position and size.
- 深度（距根的距离）和高度（距最深叶子的距离）用于度量位置和大小。
2. Binary Trees and Properties | 二叉树及其性质
A binary tree is a tree where each node has at most two children, referred to as the left child and the right child. A full binary tree is one in which every node has either 0 or 2 children. A complete binary tree is a binary tree that is completely filled at all levels except possibly the last, which is filled from left to right.
二叉树是一种每个节点最多有两个子节点的树，分别称为左孩子和右孩子。满二叉树是每个节点要么有 0 个要么有 2 个孩子的二叉树。完全二叉树是一种除了最底层可能不满外，所有层都完全填满，且最底层节点从左向右填充的二叉树。
Important properties help you calculate node counts:
重要的性质有助于计算节点数量：
- At level i (root at level 1), the maximum number of nodes is 2ⁱ⁻¹.
- 在第 i 层（根为第 1 层），最大节点数为 2ⁱ⁻¹。
- A binary tree of height h (or depth h) can have at most 2ʰ − 1 nodes.
- 高度为 h（或深度为 h）的二叉树最多有 2ʰ − 1 个节点。
- For a non-empty binary tree with n nodes, the number of edges is n − 1.
- 对于具有 n 个节点的非空二叉树，边数为 n − 1。
3. Binary Search Trees (BST) | 二叉搜索树
A binary search tree is a binary tree that follows a strict ordering property: for any node, all values in its left subtree are less than the node’s value, and all values in the right subtree are greater (or equal, depending on implementation). This structure allows efficient searching, insertion, and deletion – average time complexity O(log n) for balanced trees.
二叉搜索树是一种遵循严格排序性质的二叉树：对于任意节点，其左子树中的所有值都小于该节点的值，右子树中的所有值都大于（或等于，视实现而定）。这种结构允许高效的查找、插入和删除——对于平衡树，平均时间复杂度为 O(log n)。
Searching a BST: start at the root. If the target equals the current node’s value, search is successful. If the target is smaller, move to the left child; if larger, move to the right child. Repeat until found or a null reference is reached.
在 BST 中查找：从根开始。若目标等于当前节点的值，查找成功。若目标更小，移至左孩子；若更大，移至右孩子。重复直到找到目标或遇到空引用。
Insertion: follow the same path as searching; when a null child is reached, insert the new node there. Deletion has three cases: leaf (just remove), node with one child (bypass the node), node with two children (replace with in-order successor or predecessor).
插入：沿着与查找相同的路径；当到达空孩子时，在该处插入新节点。删除有三种情况：叶节点（直接移除），只有一个孩子的节点（绕过该节点），有两个孩子的节点（用中序后继或前驱替换）。
4. Tree Traversals: Depth-First | 树的深度优先遍历
Traversing a tree means visiting every node exactly once in a systematic order. The three standard depth-first traversals for binary trees are:
遍历树是指按照特定的顺序恰好访问每个节点一次。二叉树的三种标准深度优先遍历是：
- Pre-order: visit root, then left subtree, then right subtree. (Root → Left → Right)
- 前序遍历：先访问根，再左子树，然后右子树。（根 → 左 → 右）
- In-order: visit left subtree, then root, then right subtree. (Left → Root → Right)
- 中序遍历：先访问左子树，再根，然后右子树。（左 → 根 → 右）
- Post-order: visit left subtree, then right subtree, then root. (Left → Right → Root)
- 后序遍历：先访问左子树，再右子树，然后根。（左 → 右 → 根）
These traversals can be implemented easily using recursion. In-order traversal of a BST yields a sorted list of values. Pre-order is used to create a copy of the tree; post-order is useful for deleting the tree or evaluating expression trees.
这些遍历很容易用递归实现。二叉搜索树的中序遍历会产生排序后的值列表。前序遍历用于创建树的副本；后序遍历在删除树或计算表达式树时很有用。
5. Expression Trees | 表达式树
An expression tree is a binary tree that represents an arithmetic expression. Leaf nodes contain operands (numbers or variables), and internal nodes contain operators. The tree structure naturally captures precedence and associativity.
表达式树是一种表示算术表达式的二叉树。叶节点包含操作数（数字或变量），内部节点包含运算符。树的结构自然地体现了优先级和结合性。
For example, the expression (3 + 4) × 5 could be represented by a root node ‘×’ with left child ‘ ing children 3 and 4) and right child 5. Different traversals produce different notations:
例如，表达式 (3 + 4) × 5 可以用根节点 ‘×’，左孩子为 ‘+’（其孩子为 3 和 4），右孩子为 5 的树表示。不同的遍历产生不同的记法：
- In-order traversal generates the familiar infix notation (3 + 4) × 5 (parentheses may be needed).
- 中序遍历生成熟悉的中缀表示法 (3 + 4) × 5（可能需要括号）。
- Pre-order traversal yields prefix (Polish) notation: × + 3 4 5.
- 前序遍历产生前缀（波兰）表示法：× + 3 4 5。
- Post-order traversal yields postfix (Reverse Polish) notation: 3 4 + 5 ×.
- 后序遍历产生后缀（逆波兰）表示法：3 4 + 5 ×。
Expression trees are fundamental to how compilers and interpreters evaluate expressions.
表达式树是编译器和解释器进行表达式求值的基础。
6. Heaps | 堆
A heap is a special complete binary tree that satisfies the heap property: in a max-heap, every parent node is greater than or equal to its children; in a min-heap, every parent is less than or equal to its children. The highest (or lowest) priority element is always at the root.
堆是一种特殊的完全二叉树，满足堆性质：在最大堆中，每个父节点都大于或等于其子节点；在最小堆中，每个父节点都小于或等于其子节点。最高（或最低）优先级的元素总是在根位置。
- A heap is typically stored as an array. For a node at index i (1-based), its left child is at 2i, right child at 2i+1, parent at floor(i/2).
- 堆通常存储为数组。对于基于 1 的索引，位于索引 i 的节点，其左孩子在 2i，右孩子在 2i+1，父节点在 floor(i/2)。
- Insert: add the new value at the end of the array (maintaining complete tree) then “bubble up” by swapping with its parent until the heap property is restored.
- 插入：将新值添加到数组末尾（保持完全性），然后通过与其父节点交换“上浮”，直到恢复堆性质。
- Delete root: replace the root with the last element, remove the last element, then “bubble down” (heapify) by swapping with the larger (max-heap) or smaller (min-heap) child.
- 删除根：用最后一个元素替换根，移除最后一个元素，然后通过与较大（最大堆）或较小（最小堆）孩子交换“下沉”（堆化）。
Heaps are used to implement priority queues and the heap sort algorithm. Understanding the array representation is crucial for the Edexcel specification.
堆用于实现优先队列和堆排序算法。理解数组表示法对于 Edexcel 考纲至关重要。
7. Implementing Trees | 树的实现
Trees can be implemented using an object-oriented approach with nodes containing data and references to child nodes. In pseudocode, a typical TreeNode class includes:
树可以使用面向对象的方法实现，节点包含数据和指向孩子节点的引用。在伪代码中，典型的 TreeNode 类包括：
Node = {data, leftChild, rightChild}
Alternative implementations use arrays or lists. A general tree can be represented by a node that holds a list of children. For binary trees, a linked representation is standard. When the tree is complete or near-complete (like a heap), an array representation is more memory-efficient.
另一种实现使用数组或列表。一般树可以用包含一个孩子列表的节点表示。对于二叉树，通常使用链接表示法。当树是完全或接近完全时（如堆），数组表示法内存效率更高。
Recursion is the natural tool for tree algorithms because the structure of a tree is itself recursive: a binary tree is either empty or a root with two binary subtrees.
递归是树算法的天然工具，因为树的结构本身就是递归的：一棵二叉树要么为空，要么是一个根加上两棵二叉子树。
8. Applications of Trees | 树的应用
Trees are everywhere in computing. Here are key applications you should mention in exam answers:
树在计算中无处不在。以下是你应该在考试答案中提及的关键应用：
| Application / 应用 | Tree Structure / 树结构 |
|---|---|
| File system directories | General tree (folders & files) |
| HTML / XML DOM | Tree with elements as nodes |
| Parser syntax tree | Expression tree / parse tree |
| Huffman coding | Binary tree for compression |
| Network routing | Trie or spanning tree |
| AI decision making | Decision tree |
| Database indexing (B-tree) | Balanced multi-way tree |
For the Edexcel exam, be ready to explain how a binary search tree speeds up search compared with a linked list, and how a heap can be used for a task scheduler.
对于 Edexcel 考试，要准备好解释二叉搜索树相比链表如何加速查找，以及堆如何用于任务调度器。
9. Exam Tips and Common Pitfalls | 考试技巧与常见误区
Examiners look for accuracy in traversal sequences and clear understanding of BST operations. Common mistakes include:
考官注重遍历序列的准确性以及对 BST 操作的清晰理解。常见错误包括：
- Mixing up pre-order, in-order and post-order. Remember: pre = root first; in = root in the middle; post = root last.
- 混淆前序、中序和后序。记住：前序 = 根在先；中序 = 根在中间；后序 = 根在最后。
- Forgetting that an empty tree is a valid tree. Traversal of an empty tree returns nothing.
- 忘记空树也是有效的树。遍历空树不产生任何输出。
- When deleting a node with two children from a BST, failing to find the correct in-order successor (the smallest value in the right subtree).
- 在从 BST 删除有两个孩子的节点时，未能找到正确的中序后继（右子树中的最小值）。
- Confusing heap array indices (0-based vs 1-based). Edexcel pseudocode often uses 1-based indexing for heaps, so children are 2i and 2i+1.
- 搞混堆的数组索引（基于 0 与基于 1）。Edexcel 伪代码通常对堆使用基于 1 的索引，因此孩子是 2i 和 2i+1。
- Overlooking that a traversal sequence can uniquely determine a binary tree only when combined (e.g., pre-order + in-order).
- 忽略只有组合遍历序列（如前序 + 中序）才能唯一确定一棵二叉树。
10. Summary | 总结
Mastering trees for Edexcel A-Level Computer Science means being comfortable with terminology, binary tree properties, BST dynamics, depth-first traversals, expression trees, heaps, and implementation ideas. Practise drawing trees step by step for insertion, deletion, and traversal questions. Connect theory to real-world scenarios such as file systems, expression evaluation, and priority queues to build deeper understanding. With the bilingual explanations above and consistent practice, you will be well-prepared to answer any tree-related question in the exam.
掌握 Edexcel A-Level 计算机的树，意味着能熟练运用术语、二叉树性质、BST 动态、深度优先遍历、表达式树、堆和实现思想。针对插入、删除和遍历题目，画出树的逐步过程进行练习。将理论与文件系统、表达式求值和优先队列等实际场景联系起来，加深理解。结合上述中英双语讲解和持续练习，你将完全有能力解答考试中的任何树相关问题。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图