Is it possible to write the function that can remove an extra edge ? we only nee

Question

Is it possible to write the function that can remove an extra edge ?
we only need to implement the method RemoveExtraEdge(Node Root), and the function is taking the parameter Node root,

and the root has left , right as children

RemoveExtraEdge(Node root) in java I have a BST which looks like below. How can I remove extra edge not needed from BST? 4 want the tree to be binary search tree, but the last child 5 is related to parent 2 and 3, which does not make the tree bst, so I want to remove the edge 2-5 or 3-5) 1 2 4 5 2 3 4 5 1->2, 1->3, 2->4, 2->5, 3->5 Should remove either 2->5 or 3->5 RemoveExtraEdge (Node root) java

Explanation / Answer

this code should do the work what you wnated. Thanks!

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.