How to judge whether the python binary tree is balanced or not

What this article shares with you is about how to judge whether the python binary tree is balanced or not. The editor thinks it is very practical, so I share it with you. I hope you can get something after reading this article.

Public class IsBalanceTree {public static void main (String [] args) {IsBalanceTree bt = new IsBalanceTree (); TreeNode root = new TreeNode (1); TreeNode N1 = new TreeNode (1); TreeNode N2 = new TreeNode (1); TreeNode n3 = new TreeNode (1); / / TreeNode N4 = new TreeNode (1); root.left = N1; root.right = N2; n1.left = n3 / / n3.left = n4if / System.out.println (bt.getHeight (root)); System.out.println (bt.isBalance (root));} int getHeight (TreeNode root) {if (root = = null) return 0; int left = getHeight (root.left); int right = getHeight (root.right); / / return left > right? (left+1): (right + 1) Return 1 + Math.max (left, right);} boolean isBalance (TreeNode root) {if (root = = null) return true; int left = getHeight (root.left); int right = getHeight (root.right); if (left-right > 1 | | left-right <-1) {return false;} return isBalance (root.left) & & isBalance (root.right) }} above is how to judge whether the python binary tree is balanced or not. The editor believes that there are some knowledge points that we may see or use in our daily work. I hope you can learn more from this article. For more details, please follow the industry information channel.