071_072_Tree Traversal for ds 0000 .pptx

This ppt are showing the ds related questions and answers to understand the graph.

1. Tree Traversal ( Inorder , Preorder, Post Order) Data Structures Computer Engineering | 3ce2-a batch • Janvi Patel - 12402040701072 • Kachhiapatel Janvi R. - 12402040701071

2. Objectives and Outline What is Tree Traversal? The Three Main Rules Know core traversal techniques: inorder , preorder, postorder Quick examples with binary trees Where is this used in Real Life?

3. What is Tree Traversal? It's a plan to visit every single spot (node) on a tree. Think of it like reading a book: you need to read every page, but you can start at the beginning, the middle, or the end! We use it to print, search, or process all the data in the tree.

4. The Three Main Rules Preorder: Visit ROOT -> Go LEFT -> Go RIGHT Inorder : Go LEFT -> Visit ROOT -> Go RIGHT Postorder : Go LEFT -> Go RIGHT -> Visit ROOT

5. The Three Main Rules Preorder Traversal Visit root first Traverse left subtree Traverse right subtree Order: Root → Left → Right Inorder Traversal Traverse left subtree Visit root Traverse right subtree Order: Left → Root → Right Postorder Traversal Traverse left subtree Traverse right subtree Visit root Order: Left → Right → Root

6. Let's Try It! Preorder: 1, 2, 3 (Root, Left, Right) Inorder : 2, 1, 3 (Left, Root, Right) Postorder : 2, 3, 1 (Left, Right, Root) (1) / \ (2) (3)

7. C++ Code (The Easy Way) We use something called recursion . It's like a function that calls itself to do a smaller job. Preorder Code void preOrder (Node* node) { if (node == nullptr ) return; // Stop if empty cout << node->data << " "; // Visit ROOT preOrder (node->left); // Go LEFT preOrder (node->right); // Go RIGHT }

8. Where is this used in Real Life? Preorder: To make a perfect copy of a tree. Inorder : To get all numbers from a special tree (BST) in perfect sorted order. Postorder : To delete a tree safely (you have to delete the leaves before the branches!).

9. Thank You!