# 数据结构类

- [23. 不同路径](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/23-bu-tong-lu-jin.md)
- [24. 不同路径 II](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/24-bu-tong-lu-jin.md)
- [25. 最小路径和](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/25-zui-xiao-lu-jin-he.md)
- [29. 删除排序链表中的重复元素](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/29-shan-chu-pai-xu-lian-biao-chong-fu-yuan-su.md)
- [30. 相同的树](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/30-xiang-tong-de-shu.md)
- [31. 二叉树的最小深度](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/31-er-cha-shu-de-zui-xiao-shen-du.md)
- [32. 路径总和](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/32-lu-jin-zong-he.md)
- [34. 相交链表](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/34-xiang-jiao-lian-biao.md)
- [37. 翻转二叉树](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/37-fan-zhuang-er-cha-shu.md)
- [38. 二叉树的所有路径](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/38-er-cha-shu-suo-you-lu-jin.md)
- [41. 两个数组的交集](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/41-liang-ge-shu-zu-de-jiao-ji.md)
- [44. 左叶子之和](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/44-zuo-ye-zi-zhi-he.md)
- [46. 路径总和 III，和为某个数](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/46-lu-jin-zong-he.md)
- [47. 数组中重复的数据](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/47-shu-zu-zhong-chong-fu-de-shu-ju.md)
- [52. 二叉树的直径](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/52-er-cha-shu-de-zhi-jin.md)
- [55. N叉树的最大深度](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/55-n-cha-shu-de-zui-da-shen-du.md)
- [56. 二叉树的坡度](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/56-er-cha-shu-de-po-du.md)
- [57. 另一个树的子树](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/57-ling-yi-ge-shu-de-zi-shu.md)
- [58. N叉树的前序遍历(未使用迭代算法)](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/58-n-cha-shu-de-qian-xu-bian-li.md)
- [59. N叉树的后序遍历(未使用迭代算法)](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/59-n-cha-shu-de-hou-xu-bian-li.md)
- [60. 根据二叉树创建字符串](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/60-gen-ju-er-cha-shu-chuang-jiang-zi-fu-chuang.md)
- [63. 最长同值路径(递归)](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/63-zui-chang-tong-zhi-lu-jin.md)
- [68. 叶子相似的树](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/68-ye-zi-xiang-si-de-shu.md)
- [69. 反转链表](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/69-fan-zhuan-lian-biao.md)
- [70. 两个链表的第一个公共结点](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/70-liang-ge-lian-biao-di-yi-gong-gong-jie-dian.md)
- [71. 链表中倒数第k个结点](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/71-lian-biao.md)
- [72. 树的子结构](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/72-shu-de-zi-jie-gou.md)
- [73. 合并两个排序的链表](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/73-he-bin-liang-ge-pai-xu-lian-biao.md)
- [合并n个有序列表](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/he-bingnge-you-xu-lie-biao.md)
- [74. 二叉树的镜像](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/74-er-cha-shu-jing-xiang.md)
- [76. 调整数组顺序使奇数位于偶数前面](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/76-tiao-zheng-shu-zu.md)
- [创建二叉树/遍历](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/create-tree.md)
- [实现霍夫曼树的基本操作](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/huffman-tree.md)
- [KMP字符串](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/kmp.md)
- [二叉树节点计算](https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei/er-cha-shu-jie-dian-ji-suan.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/shu-ju-jie-gou-lei.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.