but this tree is not balance, so we will find inorder predecessor or inorder successor and replace it with root node now. In this problem we will use inorder predecessor-Root node will be 16.
So, option (D) is correct.You must be logged in to post a comment.
All Stack operations are performed smoothly. So, option (B) is correct.You must be logged in to post a comment.
You must be logged in to post a comment.
24. Which of the following is not an inherent application of stack?
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.