Awesome q2a theme
0 votes
5 views
In a binary tree T, for a node v, the LEFT-HEIGHT(v) is the length of the longest path from v to any leaf in the left subtree of v. If v has no left child then LEFT-HEIGHT(v) = 0. The RIGHT-HEIGHT(v) is defined accordingly. A node v is said to be properly balanced if       |LEFT-HEIGHT(v) -RIGHT-HEIGHT(v)| ≤ 1. Design an efficient algorithm that, given a binary tree, enumerates all the nodes which are properly balanced.
in DS by (10 points) | 5 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Apr 2020
  1. Ram Swaroop

    38 Points

  2. Kushagra गुप्ता

    36 Points

  3. !KARAN

    36 Points

  4. sushmitagoswami

    6 Points

  5. iot_ts

    6 Points

  6. Theda53E2483

    5 Points

  7. FrancescoG89

    5 Points

  8. PalmaMast586

    5 Points

  9. MarciaNaranj

    5 Points

  10. AntoniaSchne

    5 Points

3,527 questions
1,658 answers
10,469 comments
90,058 users