Procedure of Inorder Traversal:

Visit the Left Subtree: Recursively traverse the left subtree until a leaf node or a node with no left child is reached.
Visit the Current Node: Once at a node, perform the visitation operation (such as printing the node's value or performing an operation with the node's data).
Traverse the Right Subtree: After visiting the current node, recursively traverse the right subtree, following the same steps as the left subtree.

Read about Inorder Traversal in detail here

It is the type of Depth First Traversal where nodes are visited in the order: Root, Left then Right.

It's named "preorder" because the "Visit" step occurs before traversing the left and right child nodes.

Procedure of Preorder Traversal:

Visit the Current Node: Begin by visiting the current node, performing the visitation operation (such as printing the node's value or performing an operation with the node's data).
Traverse the Left Subtree: Recursively traverse the left subtree, following the same steps starting from step 1.
Traverse the Right Subtree: After fully traversing the left subtree, recursively traverse the right subtree, following the same steps starting from step 1.

Read about Preorder Traversal in detail here

It is the type of Depth First Traversal where nodes are visited in the order: Left, Right then Root.

It's named "postorder" because the "Visit" step occurs after traversing the left and right child nodes.

Procedure of Postorder Traversal:

Traverse the Left Subtree: Recursively traverse the left subtree, following the same steps starting from step 1.
Traverse the Right Subtree: Similarly, recursively traverse the right subtree, following the same steps starting from step 1.
Visit the Current Node: After fully traversing both left and right subtrees, visit the current node, performing the visitation operation (such as printing the node's value or performing an operation with the node's data).

Read about Postorder Traversal in detail here

Inorder: Left, Visit, Right

Visits nodes in ascending order in a BST, accessing left children before the parent and then the right children.

Preorder: Visit, Left, Right

Starts with the root node, visits the current node before its children, then moves to left and right children.

Postorder: Left, Right, Visit

Visits the children nodes before the parent node, exploring left and right subtrees before visiting the current node.

Level Orde