Question: Part c. [3 points] In an AVL Tree, if a node to-be-deleted has two children, a candidate node needs to be found in the sub-tree.
![Part c. [3 points] In an AVL Tree, if a node](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f05d1267946_49866f05d120b727.jpg)
Part c. [3 points] In an AVL Tree, if a node to-be-deleted has two children, a candidate node needs to be found in the sub-tree. Assume an AVL Tree T that stores integers as keys, is given. Write a method that returns the candidate node in the sub-tree T. publio Node returnCandidate (AVL T) \{
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
