Ques: We know how the regular tree walk algorithm works. If you have some values in the tree then the tree walk algorithm prints everything in order. This means all the succesor and predessor are near eachother. Explain Why all the successor and predessors are near eachother with the tree walk algorithm. Remember about the situation when there is a subtree and when there is no subtree.
Aucun commentaire:
Enregistrer un commentaire