Question: l is a list of intergers please prove this binary tree is generated calling treeGen(l,0,len(l) -1) is balanced binary tree please more quicklythank you so

l is a list of intergers
please prove this binary tree is generated calling treeGen(l,0,len(l) -1) is balanced binary tree
please more quicklythank you so much!
Algorithm : TreeGen(1,lo,hi)1 iflo == hithen return TreeNode (1[10]); else m-b (10+hi)/2c; t-TreeNode (1 [m]); t.left-TreeGen(1, lo, m-1); t.right-TreeGen(1, m+ 1, hi); return t; t
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
