Here I have proposed the solution for one of the most famous interview questions asked in the "FAANG" companies in Binary Trees Data Structure. Here I have used "Depth First Search" traversal technique to calculate maximum depth of root node and thus will be equal to the diameter of the given binary tree.
sohamsshah
commented
2 years ago
Here I have proposed the solution for one of the most famous interview questions asked in the "FAANG" companies in Binary Trees Data Structure. Here I have used "Depth First Search" traversal technique to calculate maximum depth of root node and thus will be equal to the diameter of the given binary tree.