Question: Write a recursive function that will return the minimum absolute difference between values of any two sibling nodes on a given ordered binary tree. Function
Write a recursive function that will return the minimum absolute difference between values of any two sibling nodes on a given ordered binary tree. Function should return -1 if there are no nodes with two children in the tree. (use python)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
