Bifalgorithm post · Brisk · Chapter 1

How do you begin a post-order traversal of a tree?

How do you begin a post-order traversal of a tree? (Brisk · Chapter 1) — "To traverse a tree post-order , we: 1. Treat the left child and all its descendants a…

Ideas in this flowchart

  • Post-order traversal of a tree
  • First, traverse the left child and all its descendants as a complete subtree
  • Then, traverse the right child and all its descendants as a complete subtree
Bifalgorithm
Sign up
Feed/

How do you begin a post-order traversal of a tree?

Channel

Brisk

1 page

U
USR292600b83e2a
Ebook3w

"To traverse a tree post-order , we: 1. Treat the left child and all its descendants as a subtree, and traverse it in its entirety. 2. Do the same with the right child."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.