0 0 votes Programming in C + – garimanand 877 views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Show 3 previous comments kumar.dilip commented Dec 2, 2018 reply Follow flag garimanand When there will be only one node, It is returning 1.i.e. when there only one node then height should be zero. But here returning one. So, It is counting the nodes in the longest path. 0 0 replyShare garimanand commented Dec 2, 2018 reply Follow flag it depends upon consideration whether we consider root node at height 1 or 0 i dont think there is any rule of this kind?? correct me if m wrong 0 0 replyShare kumar.dilip commented Dec 2, 2018 reply Follow flag garimanand you can take.But generally we assume zero.Also we can see the code of to find the height of the tree. 0 0 replyShare Please log in or register to add a comment.