Programming Interview Questions 26: Trim Binary Search Tree

最新推荐文章于 2022-12-02 12:07:24 发布

bachelorchen

最新推荐文章于 2022-12-02 12:07:24 发布

阅读量355

点赞数

分类专栏： interview

本文链接：https://blog.csdn.net/bachelorchen/article/details/45578367

版权

interview 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

My Facebook interview question. Feb of 2015

Programming Interview Questions 26: Trim Binary Search Tree

O(n) complexity

void remove(TreeNode *r) {
  if (!r) return;
  remove(r->left);
  remove(r->right);
  delete r;
}

TreeNode *trim(TreeNode *r, int min, int max) {
  if (!r) return r;
  TreeNode *le = NULL, *ri = NULL;
  if (r->val < min) {
    remove(r->left);
  } else {
    le = trim(r->left, min, max);
  }
  if (r->val > max) {
    remove(r->right);
  } else {
    ri = trim(r->right, min, max);
  }
  if (r->val >= min && r->val <= max) {
    r->left = le;
    r->right = ri;
  } else {
    delete r;
    r = le? le:ri;
  }
  return ri;
}

There should be some optimization space.

TODO