[关闭]
@Lin-- 2020-02-16T08:21:14.000000Z 字数 501 阅读 320

searchBST

Leetcode


典型又基础的二叉搜索树寻找结点算法

  1. /*
  2. *File:searchBST.c
  3. *Author:0HP
  4. *Date:20200216
  5. *Purpose:to solve the problem in Leetcode
  6. *https://leetcode.com/problems/search-in-a-binary-search-tree/
  7. */
  8. #include<stdio.h>
  9. #include<stdlib.h>
  10. struct TreeNode {
  11. int val;
  12. struct TreeNode *left;
  13. struct TreeNode *right;
  14. };
  15. struct TreeNode* searchBST(struct TreeNode* root, int val)
  16. {
  17. if(root==NULL){return NULL;}
  18. else
  19. {
  20. if(val<root->val)
  21. {return searchBST(&(*root->left),val);}
  22. else if(val>root->val)
  23. {return searchBST(&(*root->right),val);}
  24. else
  25. {
  26. return &(*root);
  27. }
  28. }
  29. }
添加新批注
在作者公开此批注前,只有你和作者可见。
回复批注