the program implements postorder traversal with some calls possibly being eliminated because of early termination specificallyif any left subtree is not height-balanced we do not need to visit the corresponding right subtree the function call stack corresponds to sequence of calls from the root through the unique path to the current nodeand the stack height is therefore bounded by the height of the treeleading to an (hspace bound the time complexity is the same as that for postorder traversalnamely (nvariantwrite program that returns the size of the largest subtree that is complete variantdefine node in binary tree to be -balanced if the difference in the number of nodes in its left and right subtrees is no more than design an algorithm that takes as input binary tree and positive integer kand returns node in the binary tree such that the node is not -balancedbut all of its descendants are -balanced for examplewhen applied to the binary tree in figure on page if your algorithm should return node