Find Distance Between Two Nodes of a Binary Tree using JavaScript
Last Updated :
30 Apr, 2024
In computer science, binary trees are hierarchical data structures that consist of nodes. Each node can have two children at most - one on the left side and one on the right. These structures have a top-to-bottom order. Solving for distance between any two given nodes is a problem often seen with binary trees. We'll look at different ways to find this distance in JavaScript.
Problem Description: Given a binary tree and two node values, the task is to find the distance between the two nodes.
Consider the following binary tree:
Explanation: To find the distance between nodes 4 and 6, we first locate their common ancestor, which is node 2. From this ancestor, the path to node 4 is of length 1, and the path to node 6 is of length 3. Therefore, the total distance between nodes 4 and 6 is 4.
Output: The distance between nodes 4 and 6 in the binary tree is 4.
There are several approaches to find the distance between two nodes of a Binary tree using JavaScript which are as follows:
Using Brute Force
In the brute force approach, we traverse the binary tree recursively, calculating the distance from the root to both target nodes. We then sum up these distances to find the total distance between the nodes.
- In this approach, for each node in the binary tree, we find the distance to both target nodes.
- We start from the root and traverse the tree recursively.
- We calculate the distance to both target nodes for each node encountered using depth-first search.
- Finally, we sum up the distances from the root to both nodes to get the total distance.
Example: To demonstrate finding the distance between two nodes of a Binary tree using brute force in JavaScript.
JavaScript
class BinaryNode {
constructor(val)
{
this.val = val;
this.left = null;
this.right = null;
}
}
// Function to find distance between
// two nodes using brute force approach
function findDistanceBruteForce(root, p, q)
{
// Function to find distance
// from root to a given node
function findDepth(node, target)
{
if (!node) return 0;
if (node.val === target) return 0;
const left = findDepth(node.left, target);
const right = findDepth(node.right, target);
if (left !== -1) return left + 1;
if (right !== -1) return right + 1;
return -1;
}
const distanceP = findDepth(root, p);
const distanceQ = findDepth(root, q);
return distanceP + distanceQ;
}
// Construct the binary tree
const root = new BinaryNode(1);
root.left = new BinaryNode(2);
root.right = new BinaryNode(3);
root.left.left = new BinaryNode(4);
root.left.right = new BinaryNode(5);
root.right.right = new BinaryNode(6);
const node1 = 4;
const node2 = 6;
// Find distance between node1 and node2 using brute force approach
console.log("Distance between", node1,
"and", node2, "using brute force approach is",
findDistanceBruteForce(root, node1, node2));
Output:
Distance between 4 and 6 using brute force approach is 4
Time Complexity: O(n^2)
Space Complexity: O(h)
Using Lowest Common Ancestor (LCA)
To optimize the brute force approach, we utilize the concept of the Lowest Common Ancestor (LCA). We first find the LCA of the two target nodes, then calculate the distances from the LCA to both nodes, and finally sum up these distances to get the total distance between the nodes.
- We can optimize the previous approach by first finding the Lowest Common Ancestor (LCA) of the two target nodes.
- Once we have the LCA, we can calculate the distances from the LCA to both target nodes using depth-first search.
- Finally, we sum up these distances to get the total distance between the target nodes.
Example: To demonsrtate finding the distance between two nodes of a Binary tree using JavaScript Lowest common ancestor.
JavaScript
class TreeNode {
constructor(val) {
this.val = val;
this.left = null;
this.right = null;
}
}
// Function to find Lowest
// Common Ancestor (LCA)
function findLCA(root, p, q)
{
if (!root || root
.val === p || root
.val === q) return root;
const left = findLCA(root.left, p, q);
const right = findLCA(root.right, p, q);
if (left && right) return root;
return left ? left : right;
}
// Function to find distance
// between two nodes using LCA
function findDistanceOptimized(root, p, q) {
const lca = findLCA(root, p, q);
// Function to find distance
// from root to a given node
function findDepth(node, target, depth) {
if (!node) return 0;
if (node.val === target) return depth;
const left = findDepth(node.left, target, depth + 1);
const right = findDepth(node.right, target, depth + 1);
return left || right;
}
const distanceP = findDepth(lca, p, 0);
const distanceQ = findDepth(lca, q, 0);
return distanceP + distanceQ;
}
// Construct the binary tree
const root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);
root.left.left = new TreeNode(4);
root.left.right = new TreeNode(5);
root.right.right = new TreeNode(6);
const node1 = 4;
const node2 = 6;
// Find distance between node1 and node2
// using optimized approach with LCA
console.log("Distance between",
node1, "and", node2, "using optimized approach with LCA is",
findDistanceOptimized(root, node1, node2));
Output:
Distance between 4 and 6 using optimized approach with LCA is 4
Time Complexity: O(n)
Space Complexity: O(h)
Using Single Traversal
In this approach, we further optimize by finding both the LCA and the distances from the LCA to both nodes in a single traversal of the binary tree. This reduces the time complexity compared to the previous approaches.
- We can further optimize by finding both the LCA and the distances from the LCA to both nodes in a single traversal of the binary tree.
- During the traversal, if we find both target nodes, we return their depths to their common ancestor.
- If only one node is found, we return its depth and continue the traversal.
- Once both nodes are found, we return their depths to their common ancestor and calculate the total distance.
Example: To demonsrtate finding the distance between two nodes of Binary tree using single traversal in JavaScript.
JavaScript
class TreeNode {
constructor(val) {
this.val = val;
this.left = null;
this.right = null;
}
}
// Function to find the distance
// between two nodes in a binary tree
function findDistance(root, p, q) {
// Helper function to find the
// distance from a node to the target
function findDepth(node, target, depth) {
if (!node) return 0;
if (node.val === target) return depth;
const left = findDepth(node.left, target, depth + 1);
const right = findDepth(node.right, target, depth + 1);
return left || right;
}
// Helper function to find the Lowest
// Common Ancestor (LCA) of two nodes
function findLCA(node, p, q) {
if (!node || node.val === p || node.val === q) return node;
const left = findLCA(node.left, p, q);
const right = findLCA(node.right, p, q);
if (left && right) return node;
return left ? left : right;
}
// Find the Lowest Common
// Ancestor (LCA) of the two nodes
const lca = findLCA(root, p, q);
// Calculate the distance
// from the LCA to each node
const distanceP = findDepth(lca, p, 0);
const distanceQ = findDepth(lca, q, 0);
// Total distance between the nodes
return distanceP + distanceQ;
}
// Construct the binary tree
const root = new TreeNode(1);
root.left = new TreeNode(2);
root.right = new TreeNode(3);
root.left.left = new TreeNode(4);
root.left.right = new TreeNode(5);
root.right.right = new TreeNode(6);
const node1 = 4;
const node2 = 6;
// Find distance between node1 and node2
console.log("Distance between", node1,
"and", node2,
"using further optimized approach with single traversal is",
findDistance(root, node1, node2));
Output:
Distance between 4 and 6 using further optimized approach with single traversal is 4
Time Complexity: O(n)
Space Complexity: O(h)
Similar Reads
Insert a Node in Binary tree using JavaScript A binary tree is a tree data structure where each node has at most two children, referred to as the left child and the right child. The topmost node is called the root. Nodes can have values or data, and the left child's value is less than the parent's value, while the right child's value is greater
3 min read
Find the Mode in a Binary Search Tree using JavaScript One can find the mode in a binary search tree using JavaScript. The mode in the binary search tree will be the value of the node that occurs with the highest frequency among all the nodes in the tree. If there is more than one mode present in the binary search tree then return all modes present in t
3 min read
JavaScript Program to Find Common Elements Between Two Sorted Arrays using Binary Search Given two sorted arrays, our task is to find common elements in two sorted arrays then the program should return an array that contains all the elements that are common to the two arrays. The arrays can contain duplicate elements, that is, values at one index in an array can be equal to the values a
3 min read
Kth Ancestor in Binary Tree using JavaScript Given a binary tree and a node in this tree, our task is to find the k-th ancestor of the specified node in JavaScript. If no such ancestor exists, or when k exceeds the depth of the node, the function should return null. Example: Input: Node = 5, k = 2Output: 1ApproachFirst, calculate the depth of
2 min read
Height of Binary Tree using JavaScript The height of a binary tree can be defined as the maximum depth or length of the longest path from the root node to any leaf node. Below is an example to illustrate the height of the binary tree. Height of Binary tree is 3There are several approaches to find height of Binary tree using JavaScript wh
3 min read
Count all K-Sum Paths in a Binary Tree using JavaScript Given a binary tree and a number k, our task is to find the total number of paths where the sum of the values along the path equals k. The path can start and end at any node in the tree and must go downwards means moving only from parent nodes to child nodes. ApproachDefine a class T_Node representi
2 min read
LCA in Binary Tree using JavaScript The lowest common ancestor between two nodes n1 and n2 in a binary tree is defined as the lowest node in a Tree that has both n1 and n2 as descendants. If either n1 or n2 is not present in the tree, or if they are not connected through a common ancestor, the LCA of the binary tree is NULL. Below is
4 min read
Sum of Left leaves in Binary Tree using JavaScript Calculating the sum of all left leaves in a binary tree is a common task that helps in understanding tree traversal techniques. A left leaf is defined as a leaf node that is the left child of its parent node. This problem can serve various purposes, such as evaluating symmetry in data structures or
5 min read
JavaScript Program to Find Sum of Leaf Node in Binary Tree Given a binary tree, We have to find the sum of all leaf nodes. A leaf node is a node that does not have any children. Example: Input binary tree: 1 / \ 2 3 / \ / \ 4 5 6 7The sum of leaf nodes would be: 4 + 5 + 6 + 7 = 22Table of Content Using recursive approachIterative Approach Using StackUsing r
3 min read
Search a Given Key in BST using JavaScript Given a binary search tree and a key, determine if the key is present in the tree. If the key is present, return the node containing the key otherwise, return null. Example: Input : {15,20,10,8,12,16,25}, Key : 20Output : 20 found 15 / \ 10 20 / \ / \ 8 12 16 25Table of Content Recursive ApproachIte
3 min read