try-leetcode/lcof-c/offer-68-02-CommonParentInTree.c at master · devfan2021/try-leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <stdio.h>
#include "minunit.h"

// https://leetcode-cn.com/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/
/**
 * Definition for a binary tree node.
 */
struct TreeNode
{
  int val;
  struct TreeNode *left;
  struct TreeNode *right;
};

struct TreeNode *lowestCommonAncestor(struct TreeNode *root, struct TreeNode *p, struct TreeNode *q)
{
  if (root == NULL || p == root || q == root)
  {
    return root;
  }

  struct TreeNode *leftNode = lowestCommonAncestor(root->left, p, q);
  struct TreeNode *rightNode = lowestCommonAncestor(root->right, p, q);

  if (leftNode != NULL && rightNode != NULL)
  {
    return root;
  }

  if (leftNode != NULL)
  {
    return leftNode;
  }

  if (rightNode != NULL)
  {
    return rightNode;
  }
  return NULL;
}

MU_TEST(test_case)
{
  mu_check(5 == 7);
}

MU_TEST_SUITE(test_suite)
{
  MU_RUN_TEST(test_case);
}

int main()
{
  MU_RUN_SUITE(test_suite);
  MU_REPORT();
  return MU_EXIT_CODE;
}