Find Distance In a Binary Tree

cpp

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int data;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(val) : data(val), left(nullptr), right(nullptr) {}
 * };
 */

class Solution {
public:
    int findDistance(TreeNode* root, int p, int q) {
        //Your Code Goes Here
    }
};

java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int data;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int val) { data = val; left = null, right = null }
 * }
 **/

class Solution {
    public int findDistance(TreeNode root, int p, int q) {
        //Your Code Goes Here
    }
}

python

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

class Solution(object):
    def findDistance(self, root, p, q):
        """
        :type root: Optional[TreeNode]
        :type p: int
        :type q: int
        :rtype: int
        """
        #Your Code Goes Here

javascript

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

/**
 * @param {TreeNode} root
 * @param {number} p
 * @param {number} q
 * @return {number}
 */

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

csharp

public class Solution {
    public int FindDistance(TreeNode root, int p, int q) {
        //Your Code Goes Here
    }
}

go

/*
Definition for a binary tree node.
type TreeNode struct {
      Data int
      Left *TreeNode
      Right *TreeNode
}
*/

func findDistance(root *TreeNode, p int, q int) int {

}