# 平衡樹概念 ## what is height-balanced binary A height-balanced binary tree is defined as a binary tree in which the height of the left and the right subtree of any node differ by not more than 1.
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up