#binary tree

Question

what is te diffrence b/w hight, depth, level in binary tree and can i say level= height+1   if yes then prove it

Answer 1

Height +levels +1 for  height of root considered as 1
Depth and height are same if height is the no of edges from the root to the farthest leaf node….
only diiference is that we use height for a tree and depth for a node (Height can be used with node as well)