• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE CS 2012 | Question 45

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. 


The appropriate expression for the two boxes B1 and B2 are


B1 : (1 + height(n->right)), B2 : (1 + max(h1,h2))


B1 : (height(n->right)), B2 : (1 + max(h1,h2))


B1 : height(n->right), B2 : max(h1,h2)


B1 : (1 + height(n->right)), B2 : max(h1,h2)


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments