Binary Tree Diameter Length

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root
// note: mention time and space complexity of your algorithm.Handle the edge cases.

 class Node {
 
    constructor(value=null) {
        this.left = null;
        this.right = null;
        this.parent = null;
        this.value = value;
    }
  
    insert(value) {
  
        if(!this.value) {
            this.value = value;
            return;
        }
  
        // Inserting to the left for values less than the current value
        if(value <= this.value) {
  
            if(this.left) {
                return this.left.insert(value);
            } else {
                this.left = new Node(value);
                this.left.parent = this;
            }
  
        // Insert to the right for the values greater than the current value
        } else {
            if(this.right) {
                return this.right.insert(value);
            } else {
                this.right = new Node(value);
                this.right.parent = this;
            }
        }
  
    }
  
    find(value) {
  
        if(this.value === value) {
            return this;
        }
  
        if(value < this.value && this.left) {
            return this.left.find(value);
        }
  
        if(value > this.value && this.right) {
            return this.right.find(value);
        }
  
        return null;
    }
  
    findMin(value) {
        if(!this.left) {
            return this;
        } else {
            return this.left.findMin();
        }
    }
  
    printInOrder(value) {
        if(this.left) {
            this.left.printInOrder();
        }
  
        console.log(this.value);
  
        if(this.right) {
            this.right.printInOrder();
        }
    }
  
}
  
  
class BST {
    constructor() {
        this.root = new Node();
    }
  
    insert(value) {
        this.root.insert(value);
    }
  
    find(value) {
        return this.root.find(value);
    }
  
    findMin(value) {
        return this.root.findMin();
    }
  
    printInOrder(value) {
        this.root.printInOrder();
    }
}
  
let b1 = new BST();
b1.insert(100);
b1.insert(50);
b1.insert(150);
b1.insert(80);
b1.insert(200);
b1.insert(70);
b1.insert(85)
b1.printInOrder();
  
class Solution{
  constructor() {
  }
  
  
  calcDiameter(bst){
    console.log(bst);
  }
}
  
let solution = new Solution();
console.log(solution.calcDiameter(b1));

Hello vivek.

I have retitled your post. For future posts, please make use of the main body of the post to ask your question, and give details about the problem. Also, there is no need to say “Help”, as you are posting in the sub-forum #help (AKA Programming Help).

Please place your code within backticks, like this: code = "Backticks are not apostrophes"

This helps us help you.

Hi, this video should also help with the problem. Let me know if there are any questions.