二叉树的最近公共祖先

#include <stdio.h>

typedef int ElementType;

struct BinarySearchTreeNode
{
    ElementType Element;
    struct BinarySearchTreeNode *Left;
    struct BinarySearchTreeNode *Right;
};

//be careful with the names of the node and struct
struct BinarySearchTreeNode* BinaryTreeLCA(struct BinarySearchTreeNode* TreeRoot,struct BinarySearchTreeNode* TreeNode_1,struct BinarySearchTreeNode* TreeNode_2)
{
    if(TreeRoot==NULL || TreeRoot==TreeNode_1 || TreeRoot==TreeNode_2)
    {
        return TreeRoot;
    }
    
    struct BinarySearchTreeNode* NewLeft = BinaryTreeLCA(TreeRoot -> Left,TreeNode_1,TreeNode_2);
    struct BinarySearchTreeNode* NewRight = BinaryTreeLCA(TreeRoot -> Right,TreeNode_1,TreeNode_2);
    
    if(NewLeft && NewRight)
    {
        return TreeRoot;
    }
    
    return NewLeft == NULL ? NewRight : NewLeft;
}

int main()
{
    //struct BinarySearchTreeNode *TreeNode_1;
    //struct BinarySearchTreeNode *TreeNode_2;
    //struct BinarySearchTreeNode *TreeNodeLCA;
    //TreeNode_1 = BinarySearchTreeNodeFind(2,TreeRoot);
    //TreeNode_2 = BinarySearchTreeNodeFind(-1,TreeRoot);
    //TreeNodeLCA = BinaryTreeLCA(TreeRoot,TreeNode_1,TreeNode_2);
    return 0;
}