We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Data Structures
  3. Trees
  4. Tree: Height of a Binary Tree
  5. Discussions

Tree: Height of a Binary Tree

  • a_dobryn + 2 comments

    Hm, I've returned 0 in this case and it works

    • xudonglee + 1 comment

      how it works?

      • a_dobryn + 2 comments

        Sorry, have'nt seen your reply such a long time:

        static int height(Node root) {
      	if(root == null)
            return 0;
            
            //some code then

        My code returns 0 when root is NULL and I had no problems with it. Maybe it was fixed later.

        • Tursko + 0 comments

          Yeah thats not correct. Should return -1 if root is null and 0 if there is a root with its left and right null.

        • mgeek + 1 comment

          still fails with zero when root is null.

          • anshulj07 + 0 comments

            return -1 when root is null

    • ns281 + 1 comment

      can u explain me ?

      • anshulj07 + 1 comment
        [deleted]
        • anshulj07 + 1 comment
          [deleted]
          • anshulj07 + 0 comments

            They said The Height of binary tree with single node is taken as zero. So, when we will have no node we will going to return -1