Super easy Java solution. Based on height-balanced definition

  • 0

    (1) Left subtree of T is balanced
    (2) Right subtree of T is balanced
    (3) The difference between heights of left subtree and right subtree is not more than 1.
    0_1498654944845_螢幕快照 2017-06-28 上午6.01.33.png

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.