Table of contents
-
-
- 1. multiple choice
- 2. application questions
- 3. Algorithm Design Questions
-
- (1) Count the number of leaf nodes of the binary tree.
- (3) Swap the left and right children of each node of the binary tree.
- (4) Design the double-order traversal algorithm of binary tree
- (5) Calculate the maximum width of the binary tree (the maximum width of the binary tree refers to the maximum number of nodes in all layers of the binary tree).
- (6) Using the method of traversing the binary tree in hierarchical order, count the number of nodes with degree 1 in the tree.
- (7) Find the length of the first longest path in any binary tree, and output the value of each node on this path.
- (8) Output the path from each leaf node to the root node in the binary tree.
- One word per text
-
First look at the mind map of this chapter
