[Solved]-Question 4 12 Points Unlike Previous Questions Assume Bnodes Parent Pointers Given Bnode U Q37210062

please help with this question.

Question A.4 (12 Points) Unlike the previous questions, we now assume that our BNodes have parent pointers. Given a BNode u, let binTree(u) denote the set of nodes that we can reach from u using all three BNode pointers (parent, left, right). Please write a routine boolean check (u) that binTree(u) is a valid binary tree (i.e., all the pointers are correctly set up. You must use a helper method boolean check(u, …) that is recursive. Note: we had a similar question in midterm Show transcribed image text Question A.4 (12 Points) Unlike the previous questions, we now assume that our BNodes have parent pointers. Given a BNode u, let binTree(u) denote the set of nodes that we can reach from u using all three BNode pointers (parent, left, right). Please write a routine boolean check (u) that binTree(u) is a valid binary tree (i.e., all the pointers are correctly set up. You must use a helper method boolean check(u, …) that is recursive. Note: we had a similar question in midterm

Expert Answer

---

Answer to Question A.4 (12 Points) Unlike the previous questions, we now assume that our BNodes have parent pointers. Given a BNod… . . .