Given I is a list of integers in ascending order, we use the below algorithm to build a binary tree. Algorithm 1: TreeGe

[answerhappygod]

Given I Is A List Of Integers In Ascending Order We Use The Below Algorithm To Build A Binary Tree Algorithm 1 Treege 1 (25.38 KiB) Viewed 36 times

Given I is a list of integers in ascending order, we use the below algorithm to build a binary tree. Algorithm 1: TreeGen(1, lo, hi) 1 if lo== hi then 2 return TreeNode(l[lo]); 3 else 5 6 7 8 m+ [(lo+hi)/2]; t+TreeNode(m); t.left ← TreeGen(1, lo, m - 1); t.right ← TreeGen(l, m+ 1, hi); return t; Prove that the binary tree that is generated by calling TreeGen(1, 0, len(1) – 1) is a balanced binary search tree.