SOLVED: Write a function to apply left or right rotations to a binary search…

$30.00

Category:

Description

SOLVED: Write a function to apply left or right rotations to a binary search…

In C++, Write a function to apply left or right rotations to a binary search tree based on the height of the left and right sub-trees of the root. The function should first determine if a binary search tree is height balanced, and if not, rotate the tree until it is. Your algorithm may need to apply a left or right rotation multiple times. You will not need to apply both a left and right rotation to any tree. The function should return the root of the tree.

TreeNode* CheckHeightAndRotate(TreeNode *root);


error: Content is protected !!