NEED THE ANSWER IN 30 mins
thank you
Write a recursive function find sum that traverses through all nodes in a binary tree and returns
the sum of all values as integer, if the tree is empty, the function should return None. Do not use
any built-in functions sum. The code for the Tree class, function build tree(), and the main is
already written for you. Name your file treesum.py and upload it here. cliss-Iree: 1 eeoerate a tret
fros a list of iters (data) def bukld tree(data, index)? t w Mone 14 inder i irn(data): left =
bulld_tree (dat= index+2+1) risht = build tree(data, Index+2+2) t= Tree(data[ indes), left; right)
1. recursively traverse through all nodes in a tree and retion the liom Def ifnd sunttree). a your
cede goes here 14 \[ \begin{array}{l} \text { fot }=\text { owe on }[1,2,7,4,0,6,5] \\ t=\text {
buliomtred(gate, o) } \\ \text { e flnd the sum } \\ 1 \text { o fini_luat }(t) \\ \text { assect i w } 13
\\ \end{array} \] HINTS: Get the node value and add it to the returns of other subtrees. Do not
forget to return the sum. NOTE: Please upload your hle treesum.py here..
NEED THE ANSWER IN 30 mins thank you Write a recursive .pdf
1. NEED THE ANSWER IN 30 mins
thank you
Write a recursive function find sum that traverses through all nodes in a binary tree and returns
the sum of all values as integer, if the tree is empty, the function should return None. Do not use
any built-in functions sum. The code for the Tree class, function build tree(), and the main is
already written for you. Name your file treesum.py and upload it here. cliss-Iree: 1 eeoerate a tret
fros a list of iters (data) def bukld tree(data, index)? t w Mone 14 inder i irn(data): left =
bulld_tree (dat= index+2+1) risht = build tree(data, Index+2+2) t= Tree(data[ indes), left; right)
1. recursively traverse through all nodes in a tree and retion the liom Def ifnd sunttree). a your
cede goes here 14 [ begin{array}{l} text { fot }=text { owe on }[1,2,7,4,0,6,5] t=text {
buliomtred(gate, o) } text { e flnd the sum } 1 text { o fini_luat }(t) text { assect i w } 13
end{array} ] HINTS: Get the node value and add it to the returns of other subtrees. Do not
forget to return the sum. NOTE: Please upload your hle treesum.py here.
![NEED THE ANSWER IN 30 mins
thank you
Write a recursive function find sum that traverses through all nodes in a binary tree and returns
the sum of all values as integer, if the tree is empty, the function should return None. Do not use
any built-in functions sum. The code for the Tree class, function build tree(), and the main is
already written for you. Name your file treesum.py and upload it here. cliss-Iree: 1 eeoerate a tret
fros a list of iters (data) def bukld tree(data, index)? t w Mone 14 inder i irn(data): left =
bulld_tree (dat= index+2+1) risht = build tree(data, Index+2+2) t= Tree(data[ indes), left; right)
1. recursively traverse through all nodes in a tree and retion the liom Def ifnd sunttree). a your
cede goes here 14 [ begin{array}{l} text { fot }=text { owe on }[1,2,7,4,0,6,5] t=text {
buliomtred(gate, o) } text { e flnd the sum } 1 text { o fini_luat }(t) text { assect i w } 13
end{array} ] HINTS: Get the node value and add it to the returns of other subtrees. Do not
forget to return the sum. NOTE: Please upload your hle treesum.py here.](https://image.slidesharecdn.com/needtheanswerin30minsthankyouwritearecursive-230331025427-ec4a5843/85/NEED-THE-ANSWER-IN-30-mins-thank-you-Write-a-recursive-pdf-1-320.jpg)
