Hello everyone. I need your help, it's very important for me, please help me.
Print the elements of a given perfectly balanced tree in descending order
So where is your tree?
Where is your attempt?
To print in ascending order (assuming the tree is ordered as well as balanced), you would traverse left - root- right. So to print in descending order you would traverse right - root - left
Last edited on