Lowest Common Ancestor of a Binary Tree III

cpp

/*
// Definition for a Node.
class TreeNode {
public:
    int data;
    TreeNode* left;
    TreeNode* right;
    TreeNode* parent;
};
*/



class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* p, TreeNode* q) {
     
    }
};

java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int data;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode parent;
 *     TreeNode(int x) { data = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode p, TreeNode q) {
        // Your Code Goes Here
    }
}

python

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.data = x
#         self.left = None
#         self.right = None
#         self.parent = None

class Solution:
    def lowestCommonAncestor(self, p, q):

javascript

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *      constructor(data = 0, left = null, right = null){
 *          this.data = data;
 *          this.left = null;
 *          this.right = null;
 *          this.parent = null;           
 *      }
 * }
 **/

class Solution {
    lowestCommonAncestor(p,q) {
        //your code goes here
    }
}

csharp

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int data;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode parent;
 *     TreeNode(int x) { data = x; }
 * }
 */
public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode p, TreeNode q) {
        // Your Code Goes Here
    }
}

go

func lowestCommonAncestor(p, q *TreeNode) *TreeNode {
    // Your code goes here
}