{"id":1102734,"date":"2025-01-08T16:03:04","date_gmt":"2025-01-08T08:03:04","guid":{"rendered":""},"modified":"2025-01-08T16:03:07","modified_gmt":"2025-01-08T08:03:07","slug":"python%e4%b8%ad%e5%a6%82%e4%bd%95%e5%bb%ba%e7%ab%8b%e4%ba%8c%e5%8f%89%e6%a0%91-2","status":"publish","type":"post","link":"https:\/\/docs.pingcode.com\/ask\/1102734.html","title":{"rendered":"python\u4e2d\u5982\u4f55\u5efa\u7acb\u4e8c\u53c9\u6811"},"content":{"rendered":"

\"python\u4e2d\u5982\u4f55\u5efa\u7acb\u4e8c\u53c9\u6811\"<\/p>\n

\u5728Python\u4e2d\u5efa\u7acb\u4e8c\u53c9\u6811\u7684\u65b9\u6cd5\u6709\u5f88\u591a\u79cd\uff0c\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61\u3001\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9\u3001\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811<\/strong>\u662f\u5176\u4e2d\u51e0\u79cd\u5e38\u89c1\u7684\u65b9\u6cd5\u3002\u5728\u8fd9\u91cc\u6211\u4eec\u5c06\u8be6\u7ec6\u8ba8\u8bba\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61\u7684\u65b9\u6cd5\u3002<\/p>\n<\/p>\n

\u4e00\u3001\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61<\/h3>\n<\/p>\n

1. \u5b9a\u4e49\u8282\u70b9\u7c7b<\/h4>\n<\/p>\n

\u9996\u5148\uff0c\u6211\u4eec\u9700\u8981\u5b9a\u4e49\u4e00\u4e2a\u8282\u70b9\u7c7b\u6765\u8868\u793a\u6811\u7684\u8282\u70b9\u3002\u6bcf\u4e2a\u8282\u70b9\u5305\u542b\u4e09\u4e2a\u5c5e\u6027\uff1a\u8282\u70b9\u503c\u3001\u5de6\u5b50\u8282\u70b9\u548c\u53f3\u5b50\u8282\u70b9\u3002<\/p>\n<\/p>\n

class TreeNode:<\/p>\n
    def __init__(self, value=0, left=None, right=None):<\/p>\n
        self.value = value<\/p>\n
        self.left = left<\/p>\n
        self.right = right<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5728\u8fd9\u4e2a\u7c7b\u4e2d\uff0cvalue<\/code>\u8868\u793a\u8282\u70b9\u7684\u503c\uff0cleft<\/code>\u548cright<\/code>\u5206\u522b\u8868\u793a\u5de6\u5b50\u8282\u70b9\u548c\u53f3\u5b50\u8282\u70b9\u3002<\/p>\n<\/p>\n
2. \u6784\u5efa\u4e8c\u53c9\u6811<\/h4>\n<\/p>\n
\u63a5\u4e0b\u6765\uff0c\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528\u8fd9\u4e2a\u8282\u70b9\u7c7b\u6765\u6784\u5efa\u4e00\u4e2a\u7b80\u5355\u7684\u4e8c\u53c9\u6811\u3002\u4e3a\u4e86\u6f14\u793a\uff0c\u6211\u4eec\u5c06\u6784\u5efa\u4ee5\u4e0b\u4e8c\u53c9\u6811\uff1a<\/p>\n<\/p>\n
    1<\/p>\n
   \/ \\<\/p>\n
  2   3<\/p>\n
 \/ \\<\/p>\n
4   5<\/p>\n
<\/code><\/pre>\n<\/p>\n
# \u521b\u5efa\u8282\u70b9<\/p>\n
root = TreeNode(1)<\/p>\n
root.left = TreeNode(2)<\/p>\n
root.right = TreeNode(3)<\/p>\n
root.left.left = TreeNode(4)<\/p>\n
root.left.right = TreeNode(5)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u8fd9\u79cd\u65b9\u6cd5\u76f4\u89c2\u4e14\u7b80\u5355\uff0c\u4f46\u5bf9\u4e8e\u8f83\u5927\u7684\u6811\u624b\u52a8\u6784\u5efa\u5c31\u663e\u5f97\u4e0d\u592a\u73b0\u5b9e\u3002<\/p>\n<\/p>\n
3. \u4f7f\u7528\u9012\u5f52\u6784\u5efa\u4e8c\u53c9\u6811<\/h4>\n<\/p>\n
\u4e3a\u4e86\u66f4\u9ad8\u6548\u5730\u6784\u5efa\u4e8c\u53c9\u6811\uff0c\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528\u9012\u5f52\u65b9\u6cd5\u3002\u4f8b\u5982\uff0c\u7ed9\u5b9a\u4e00\u4e2a\u5217\u8868\u6765\u8868\u793a\u4e8c\u53c9\u6811\uff0c\u6211\u4eec\u53ef\u4ee5\u9012\u5f52\u5730\u6784\u5efa\u6811\u3002<\/p>\n<\/p>\n
def build_tree(values, index=0):<\/p>\n
    if index >= len(values) or values[index] is None:<\/p>\n
        return None<\/p>\n
    node = TreeNode(values[index])<\/p>\n
    node.left = build_tree(values, 2 * index + 1)<\/p>\n
    node.right = build_tree(values, 2 * index + 2)<\/p>\n
    return node<\/p>\n
values = [1, 2, 3, 4, 5]<\/p>\n
root = build_tree(values)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5728\u8fd9\u4e2a\u65b9\u6cd5\u4e2d\uff0c\u6211\u4eec\u4f7f\u7528\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u6027\u8d28\uff08\u7236\u8282\u70b9\u7684\u7d22\u5f15\u4e3a i<\/code>\uff0c\u5219\u5de6\u5b50\u8282\u70b9\u4e3a 2*i + 1<\/code>\uff0c\u53f3\u5b50\u8282\u70b9\u4e3a 2*i + 2<\/code>\uff09\u6765\u9012\u5f52\u5730\u6784\u5efa\u6811\u3002<\/p>\n<\/p>\n
\u4e8c\u3001\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9<\/h3>\n<\/p>\n
\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9\u662f\u4e00\u79cd\u66f4\u5177\u7075\u6d3b\u6027\u7684\u65b9\u6cd5\uff0c\u5c24\u5176\u662f\u5728\u5904\u7406\u4e0d\u89c4\u5219\u6811\u7ed3\u6784\u65f6\u3002\u4f8b\u5982\uff0c\u5047\u8bbe\u6211\u4eec\u6709\u4e00\u4e2a\u5d4c\u5957\u5217\u8868\u6765\u8868\u793a\u4e8c\u53c9\u6811\uff1a<\/p>\n<\/p>\n
def build_tree_from_nested_list(data):<\/p>\n
    if not data:<\/p>\n
        return None<\/p>\n
    value = data[0]<\/p>\n
    left = build_tree_from_nested_list(data[1]) if len(data) > 1 else None<\/p>\n
    right = build_tree_from_nested_list(data[2]) if len(data) > 2 else None<\/p>\n
    return TreeNode(value, left, right)<\/p>\n
nested_list = [1, [2, [4], [5]], [3]]<\/p>\n
root = build_tree_from_nested_list(nested_list)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5728\u8fd9\u4e2a\u65b9\u6cd5\u4e2d\uff0c\u6211\u4eec\u9012\u5f52\u5730\u904d\u5386\u5d4c\u5957\u5217\u8868\u5e76\u6784\u5efa\u6811\u3002<\/p>\n<\/p>\n
\u4e09\u3001\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811<\/h3>\n<\/p>\n
\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811\u662f\u4e00\u79cd\u5e7f\u5ea6\u4f18\u5148\u7684\u6784\u5efa\u65b9\u6cd5\uff0c\u9002\u7528\u4e8e\u4ece\u5c42\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u5efa\u4e8c\u53c9\u6811\u3002\u4f8b\u5982\uff1a<\/p>\n<\/p>\n
from collections import deque<\/p>\n
def build_tree_from_level_order(values):<\/p>\n
    if not values:<\/p>\n
        return None<\/p>\n
    root = TreeNode(values[0])<\/p>\n
    queue = deque([root])<\/p>\n
    index = 1<\/p>\n
    while queue and index < len(values):<\/p>\n
        node = queue.popleft()<\/p>\n
        if values[index] is not None:<\/p>\n
            node.left = TreeNode(values[index])<\/p>\n
            queue.append(node.left)<\/p>\n
        index += 1<\/p>\n
        if index < len(values) and values[index] is not None:<\/p>\n
            node.right = TreeNode(values[index])<\/p>\n
            queue.append(node.right)<\/p>\n
        index += 1<\/p>\n
    return root<\/p>\n
values = [1, 2, 3, 4, 5]<\/p>\n
root = build_tree_from_level_order(values)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u5728\u8fd9\u4e2a\u65b9\u6cd5\u4e2d\uff0c\u6211\u4eec\u4f7f\u7528\u4e00\u4e2a\u961f\u5217\u6765\u5e2e\u52a9\u6211\u4eec\u6309\u5c42\u7ea7\u6784\u5efa\u6811\u3002<\/p>\n<\/p>\n
\u56db\u3001\u4e8c\u53c9\u6811\u7684\u904d\u5386<\/h3>\n<\/p>\n
\u6784\u5efa\u5b8c\u4e8c\u53c9\u6811\u540e\uff0c\u6211\u4eec\u901a\u5e38\u9700\u8981\u5bf9\u6811\u8fdb\u884c\u904d\u5386\u3002\u5e38\u89c1\u7684\u904d\u5386\u65b9\u5f0f\u6709\u524d\u5e8f\u904d\u5386\u3001\u4e2d\u5e8f\u904d\u5386\u548c\u540e\u5e8f\u904d\u5386\u3002<\/p>\n<\/p>\n
1. \u524d\u5e8f\u904d\u5386<\/h4>\n<\/p>\n
\u524d\u5e8f\u904d\u5386\u662f\u6307\u5148\u8bbf\u95ee\u6839\u8282\u70b9\uff0c\u7136\u540e\u8bbf\u95ee\u5de6\u5b50\u6811\uff0c\u6700\u540e\u8bbf\u95ee\u53f3\u5b50\u6811\u3002<\/p>\n<\/p>\n
def preorder_traversal(root):<\/p>\n
    if root:<\/p>\n
        print(root.value, end=' ')<\/p>\n
        preorder_traversal(root.left)<\/p>\n
        preorder_traversal(root.right)<\/p>\n
preorder_traversal(root)<\/p>\n
<\/code><\/pre>\n<\/p>\n
2. \u4e2d\u5e8f\u904d\u5386<\/h4>\n<\/p>\n
\u4e2d\u5e8f\u904d\u5386\u662f\u6307\u5148\u8bbf\u95ee\u5de6\u5b50\u6811\uff0c\u7136\u540e\u8bbf\u95ee\u6839\u8282\u70b9\uff0c\u6700\u540e\u8bbf\u95ee\u53f3\u5b50\u6811\u3002<\/p>\n<\/p>\n
def inorder_traversal(root):<\/p>\n
    if root:<\/p>\n
        inorder_traversal(root.left)<\/p>\n
        print(root.value, end=' ')<\/p>\n
        inorder_traversal(root.right)<\/p>\n
inorder_traversal(root)<\/p>\n
<\/code><\/pre>\n<\/p>\n
3. \u540e\u5e8f\u904d\u5386<\/h4>\n<\/p>\n
\u540e\u5e8f\u904d\u5386\u662f\u6307\u5148\u8bbf\u95ee\u5de6\u5b50\u6811\uff0c\u7136\u540e\u8bbf\u95ee\u53f3\u5b50\u6811\uff0c\u6700\u540e\u8bbf\u95ee\u6839\u8282\u70b9\u3002<\/p>\n<\/p>\n
def postorder_traversal(root):<\/p>\n
    if root:<\/p>\n
        postorder_traversal(root.left)<\/p>\n
        postorder_traversal(root.right)<\/p>\n
        print(root.value, end=' ')<\/p>\n
postorder_traversal(root)<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u4e94\u3001\u4e8c\u53c9\u6811\u7684\u5e94\u7528<\/h3>\n<\/p>\n
\u4e8c\u53c9\u6811\u5728\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\u6709\u5e7f\u6cdb\u7684\u5e94\u7528\uff0c\u4f8b\u5982\uff1a<\/p>\n<\/p>\n
1. \u8868\u8fbe\u5f0f\u6811<\/h4>\n<\/p>\n
\u8868\u8fbe\u5f0f\u6811\u662f\u4e00\u79cd\u7528\u4e8e\u8868\u793a\u6570\u5b66\u8868\u8fbe\u5f0f\u7684\u6811\u3002\u4f8b\u5982\uff0c\u8868\u8fbe\u5f0f (1 + 2) * 3<\/code> \u53ef\u4ee5\u8868\u793a\u4e3a\u4ee5\u4e0b\u8868\u8fbe\u5f0f\u6811\uff1a<\/p>\n<\/p>\n
    *<\/p>\n
   \/ \\<\/p>\n
  +   3<\/p>\n
 \/ \\<\/p>\n
1   2<\/p>\n
<\/code><\/pre>\n<\/p>\n
2. \u4e8c\u53c9\u641c\u7d22\u6811<\/h4>\n<\/p>\n
\u4e8c\u53c9\u641c\u7d22\u6811\u662f\u4e00\u79cd\u7279\u6b8a\u7684\u4e8c\u53c9\u6811\uff0c\u5176\u4e2d\u6bcf\u4e2a\u8282\u70b9\u7684\u503c\u5927\u4e8e\u5176\u5de6\u5b50\u6811\u4e2d\u7684\u6240\u6709\u8282\u70b9\u7684\u503c\uff0c\u5c0f\u4e8e\u5176\u53f3\u5b50\u6811\u4e2d\u7684\u6240\u6709\u8282\u70b9\u7684\u503c\u3002<\/p>\n<\/p>\n
class BinarySearchTree:<\/p>\n
    def __init__(self):<\/p>\n
        self.root = None<\/p>\n
    def insert(self, value):<\/p>\n
        self.root = self._insert(self.root, value)<\/p>\n
    def _insert(self, node, value):<\/p>\n
        if not node:<\/p>\n
            return TreeNode(value)<\/p>\n
        if value < node.value:<\/p>\n
            node.left = self._insert(node.left, value)<\/p>\n
        else:<\/p>\n
            node.right = self._insert(node.right, value)<\/p>\n
        return node<\/p>\n
    def search(self, value):<\/p>\n
        return self._search(self.root, value)<\/p>\n
    def _search(self, node, value):<\/p>\n
        if not node or node.value == value:<\/p>\n
            return node<\/p>\n
        if value < node.value:<\/p>\n
            return self._search(node.left, value)<\/p>\n
        return self._search(node.right, value)<\/p>\n
bst = BinarySearchTree()<\/p>\n
bst.insert(3)<\/p>\n
bst.insert(1)<\/p>\n
bst.insert(4)<\/p>\n
bst.insert(2)<\/p>\n
print(bst.search(2).value)  # \u8f93\u51fa 2<\/p>\n
print(bst.search(5))  # \u8f93\u51fa None<\/p>\n
<\/code><\/pre>\n<\/p>\n
\u516d\u3001\u603b\u7ed3<\/h3>\n<\/p>\n
\u5728Python\u4e2d\u5efa\u7acb\u4e8c\u53c9\u6811\u7684\u65b9\u6cd5\u6709\u5f88\u591a\u79cd\uff0c\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61\u3001\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9\u3001\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811<\/strong>\u662f\u5176\u4e2d\u51e0\u79cd\u5e38\u89c1\u7684\u65b9\u6cd5\u3002\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61\u7684\u65b9\u6cd5\u7b80\u5355\u76f4\u89c2\uff0c\u9002\u5408\u624b\u52a8\u6784\u5efa\u5c0f\u578b\u6811\uff1b\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9\u7684\u65b9\u6cd5\u7075\u6d3b\u6027\u9ad8\uff0c\u9002\u5408\u5904\u7406\u4e0d\u89c4\u5219\u6811\u7ed3\u6784\uff1b\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811\u7684\u65b9\u6cd5\u9002\u5408\u4ece\u5c42\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u5efa\u6811\u3002\u6784\u5efa\u5b8c\u4e8c\u53c9\u6811\u540e\uff0c\u6211\u4eec\u901a\u5e38\u9700\u8981\u5bf9\u6811\u8fdb\u884c\u904d\u5386\uff0c\u5e38\u89c1\u7684\u904d\u5386\u65b9\u5f0f\u6709\u524d\u5e8f\u904d\u5386\u3001\u4e2d\u5e8f\u904d\u5386\u548c\u540e\u5e8f\u904d\u5386\u3002\u4e8c\u53c9\u6811\u5728\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\u6709\u5e7f\u6cdb\u7684\u5e94\u7528\uff0c\u4f8b\u5982\u8868\u8fbe\u5f0f\u6811\u548c\u4e8c\u53c9\u641c\u7d22\u6811\u3002\u65e0\u8bba\u4f7f\u7528\u54ea\u79cd\u65b9\u6cd5\uff0c\u7406\u89e3\u4e8c\u53c9\u6811\u7684\u57fa\u672c\u7ed3\u6784\u548c\u904d\u5386\u65b9\u5f0f\u5bf9\u4e8e\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u90fd\u662f\u975e\u5e38\u91cd\u8981\u7684\u3002<\/p>\n<\/p>\n
\u76f8\u5173\u95ee\u7b54FAQs\uff1a<\/strong><\/h2>\n
 \u5982\u4f55\u5728Python\u4e2d\u5b9a\u4e49\u4e8c\u53c9\u6811\u7684\u8282\u70b9\uff1f<\/strong>
\u5728Python\u4e2d\uff0c\u53ef\u4ee5\u901a\u8fc7\u521b\u5efa\u4e00\u4e2a\u7c7b\u6765\u5b9a\u4e49\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u3002\u901a\u5e38\uff0c\u6211\u4eec\u4f1a\u521b\u5efa\u4e00\u4e2aNode<\/code>\u7c7b\uff0c\u5176\u4e2d\u5305\u542b\u4e00\u4e2a\u503c\u4ee5\u53ca\u6307\u5411\u5de6\u53f3\u5b50\u8282\u70b9\u7684\u5f15\u7528\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u7b80\u5355\u7684\u5b9e\u73b0\u793a\u4f8b\uff1a<\/p>\n
class Node:\n    def __init__(self, value):\n        self.value = value\n        self.left = None\n        self.right = None\n<\/code><\/pre>\n
\u5982\u4f55\u63d2\u5165\u65b0\u8282\u70b9\u5230\u4e8c\u53c9\u6811\u4e2d\uff1f<\/strong>
\u5728\u4e8c\u53c9\u6811\u4e2d\u63d2\u5165\u65b0\u8282\u70b9\u7684\u65b9\u5f0f\u901a\u5e38\u53d6\u51b3\u4e8e\u6811\u7684\u7c7b\u578b\uff08\u5982\u4e8c\u53c9\u641c\u7d22\u6811\uff09\u3002\u5bf9\u4e8e\u4e8c\u53c9\u641c\u7d22\u6811\uff0c\u63d2\u5165\u65b0\u8282\u70b9\u65f6\uff0c\u9700\u8981\u6839\u636e\u503c\u7684\u5927\u5c0f\u51b3\u5b9a\u5176\u4f4d\u7f6e\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u63d2\u5165\u8282\u70b9\u7684\u793a\u4f8b\u65b9\u6cd5\uff1a<\/p>\n
def insert(root, value):\n    if root is None:\n        return Node(value)\n    if value < root.value:\n        root.left = insert(root.left, value)\n    else:\n        root.right = insert(root.right, value)\n    return root\n<\/code><\/pre>\n
\u5982\u4f55\u904d\u5386\u4e8c\u53c9\u6811\u5e76\u8f93\u51fa\u8282\u70b9\u503c\uff1f<\/strong>
\u904d\u5386\u4e8c\u53c9\u6811\u53ef\u4ee5\u901a\u8fc7\u591a\u79cd\u65b9\u5f0f\u8fdb\u884c\uff0c\u5305\u62ec\u524d\u5e8f\u904d\u5386\u3001\u4e2d\u5e8f\u904d\u5386\u548c\u540e\u5e8f\u904d\u5386\u3002\u4ee5\u4e0b\u662f\u4e00\u4e2a\u4e2d\u5e8f\u904d\u5386\u7684\u793a\u4f8b\uff0c\u5b83\u4f1a\u6309\u4ece\u5c0f\u5230\u5927\u7684\u987a\u5e8f\u8f93\u51fa\u8282\u70b9\u7684\u503c\uff1a<\/p>\n
def inorder_traversal(root):\n    if root:\n        inorder_traversal(root.left)\n        print(root.value)\n        inorder_traversal(root.right)\n<\/code><\/pre>\n
\u901a\u8fc7\u8fd9\u4e9b\u57fa\u672c\u7684\u65b9\u6cd5\u548c\u7c7b\u5b9a\u4e49\uff0c\u7528\u6237\u53ef\u4ee5\u5728Python\u4e2d\u6784\u5efa\u548c\u64cd\u4f5c\u4e8c\u53c9\u6811\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"\u5728Python\u4e2d\u5efa\u7acb\u4e8c\u53c9\u6811\u7684\u65b9\u6cd5\u6709\u5f88\u591a\u79cd\uff0c\u4f7f\u7528\u7c7b\u548c\u5bf9\u8c61\u3001\u9012\u5f52\u5b9a\u4e49\u6811\u8282\u70b9\u3001\u5c42\u5e8f\u904d\u5386\u6784\u9020\u6811\u662f\u5176\u4e2d\u51e0\u79cd\u5e38\u89c1\u7684\u65b9\u6cd5\u3002\u5728 […]","protected":false},"author":3,"featured_media":1102749,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[37],"tags":[],"acf":[],"_links":{"self":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1102734"}],"collection":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/comments?post=1102734"}],"version-history":[{"count":"1","href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1102734\/revisions"}],"predecessor-version":[{"id":1102750,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/posts\/1102734\/revisions\/1102750"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media\/1102749"}],"wp:attachment":[{"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/media?parent=1102734"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/categories?post=1102734"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/docs.pingcode.com\/wp-json\/wp\/v2\/tags?post=1102734"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}