56 30 61 39 47 35 75 13 21 64 26 73 18 Given the numbers above: (a) Draw binary

Question

56   30   61   39  47 35   75   13  21   64   26 73 18 Given the numbers above: (a) Draw binary search tree, use order given (done) (b) Give the post-order (done) (c) There is one almost binary search tree, drawit(problem)     the answer given started out as                             47                   26              73 etc I cannot figure out why they started at 47. I am tryingto figure out if there is a procedure in relation to the almostcomplete tree (left oriented) needs some assistance here 56   30   61   39  47 35   75   13  21   64   26 73 18 Given the numbers above: (a) Draw binary search tree, use order given (done) (b) Give the post-order (done) (c) There is one almost binary search tree, drawit(problem)     the answer given started out as                             47                   26              73 etc I cannot figure out why they started at 47. I am tryingto figure out if there is a procedure in relation to the almostcomplete tree (left oriented) needs some assistance here

Explanation / Answer

What is the criterion/criteria used to get from one stage to the other?  For example, how 47 gets to be the root? What principle is used to move the numbers around?  I am following the logic.

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

---

---

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