A binary tree is balanced if the difference between left and right subtree of every node is not more than ____ Q & A › Category: Data Structure › A binary tree is balanced if the difference between left and right subtree of every node is not more than ____ -1 Vote Up Vote Down Admin Staff asked 4 years ago A binary tree is balanced if the difference between left and right subtree of every node is not more than ____ a) 1 b) 3 c) 2 d) 0 Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago a) 1 Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...
Admin