{"push_id":749670745,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c471cb7ba225977123d7381a21900b66047fe573","before":"c168b289bb7c9399bf19d84518dd8e03ce6afaba","commits":[{"sha":"c471cb7ba225977123d7381a21900b66047fe573","author":{"email":"52c8dcd40a309e31b1a9ed206e0c4f70a30d9fa2@126.com","name":"Zhao Wei"},"message":"v2 - iterative & recursive\n\n1. 用迭代实现；\n2. 用递归实现；\n3.\n遵循的原则是如果当前节点小于p和q的最小值，那么在二叉搜索树中，p和q在当前节点的右子树；如果当前节点大于p和q的最大值，那么它们就在当前节点的左子树。","distinct":true,"url":"https://api.github.com/repos/pkuzw/LeetCode-Zhao-Wei-/commits/c471cb7ba225977123d7381a21900b66047fe573"}]}