{"push_id":891495937,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e3f976b103da5d7676fe4833c8ba6e70c756c4f0","before":"0172899092169df8631dc765dbad0838e98e4020","commits":[{"sha":"e3f976b103da5d7676fe4833c8ba6e70c756c4f0","author":{"email":"b793688d2ce3392625c2af462b407278448d680e@qq.com","name":"jianghuiyou"},"message":"第235题 easy 一种将问题分成多种情况考虑 遇坑啊！\n\n思路：当pq两者都小于root，则递归到root左子树，当pq都大于root，则递归到右子树。否则返回root\r\n\r\n在树结构体中不能轻易交换两个节点，一开始在判断大小的时候，自己就交换了pq两个节点，造成error。","distinct":true,"url":"https://api.github.com/repos/jianghuiyou/leetcode/commits/e3f976b103da5d7676fe4833c8ba6e70c756c4f0"}]}