摘要: binary search tree (BST) 二分树的基本方法,search,insert,MAX,MIN,delete概念复习下,这道题简单的递归搜索可以解决。/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *rig... 阅读全文
posted @ 2019-02-25 09:22 miuc 阅读(192) 评论(0) 推荐(0) 编辑