| Problem ID | Title | Solved | Score | Time | Memory | Ratio(AC/All) |
|---|---|---|---|---|---|---|
| 2164Problem A | 【数据结构】二叉树的建立 | 0 | 1s | 128MB | 31.25%(5/16) | |
| 2165Problem B | 【数据结构】二叉树的叶子节点数目 | 0 | 1s | 128MB | 83.33%(5/6) | |
| 2166Problem C | 【数据结构】二叉树的深度 | 0 | 1s | 128MB | 83.33%(5/6) | |
| 2167Problem D | 【数据结构】二叉树的广度优先遍历 | 0 | 1s | 128MB | 57.14%(4/7) | |
| 2168Problem E | 【数据结构】二叉树的遍历 | 0 | 1s | 128MB | 30.00%(3/10) | |
| 2169Problem F | 【数据结构】搜索树 | 0 | 1s | 128MB | 0.00%(0/13) | |
| 2170Problem G | 【数据结构】二叉树任意节点距离 | 0 | 1s | 128MB | 66.67%(2/3) | |
| 2256Problem H | 【数据结构】二叉树的中序遍历 | 0 | 1s | 256MB | 100.00%(4/4) |