Height of Binary Tree GFG POTD (03 FEBUARY 2025)

⭐ IN THE GIVEN PROBLEM, WE NEED TO RETURN THE HEIGHT OF TREE.
⭐ FOR THIS , WE NEED TO TRAVERSE TO BOTH SIDE LEFT NODE AS WELL AS RIGHT NODE.
⭐AT FINAL WE NEED TO RETURN THOSE NODE WHICH IS HAVING HEIGHEST EDGES.
⭐ TIME COMPLEXITY: O(n)
⭐ SPACE COMPLEXITY: O(n)