| Problem ID | Title | Solved | Score | Time | Memory | Ratio(AC/All) |
|---|---|---|---|---|---|---|
| 2167Problem A | 【数据结构】二叉树的广度优先遍历 | 0 | 1s | 128MB | 35.00%(14/40) | |
| 2165Problem B | 【数据结构】二叉树的叶子节点数目 | 0 | 1s | 128MB | 57.14%(12/21) | |
| 2256Problem C | 【数据结构】二叉树的中序遍历 | 0 | 1s | 256MB | 66.67%(12/18) | |
| 2170Problem D | 【数据结构】二叉树任意节点距离 | 0 | 1s | 128MB | 66.67%(8/12) |