This document describes three tree traversal algorithms: InOrder, PreOrder, and PostOrder. InOrder first traverses the left subtree, then visits the root, then the right subtree. PreOrder first visits the root, then the left subtree, then the right subtree. PostOrder first traverses the left subtree, then the right subtree, then visits the root.
This document describes three tree traversal algorithms: InOrder, PreOrder, and PostOrder. InOrder first traverses the left subtree, then visits the root, then the right subtree. PreOrder first visits the root, then the left subtree, then the right subtree. PostOrder first traverses the left subtree, then the right subtree, then visits the root.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd
This document describes three tree traversal algorithms: InOrder, PreOrder, and PostOrder. InOrder first traverses the left subtree, then visits the root, then the right subtree. PreOrder first visits the root, then the left subtree, then the right subtree. PostOrder first traverses the left subtree, then the right subtree, then visits the root.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online from Scribd