Tree Data Structure in C

Tree Data Structure in C

Tree ek non-linear data structure hai jo hierarchical structure me data ko represent karta hai. Agar aap DSA roadmap for beginners follow kar rahe hain, to Tree ek bahut important topic hai kyunki ye advanced problems aur interviews me frequently poocha jata hai.

Tree ka concept real life structure jaise family tree ya organization hierarchy jaisa hota hai. Isme ek root node hota hai aur uske children nodes hote hain jo ek tree-like structure banate hain.

DSA me strong banne ke liye Tree samajhna zaroori hai, kyunki Graph, Heap aur Trie jaise advanced topics isi par based hote hain.

📌 What is Tree in Data Structure?

Tree ek collection hota hai nodes ka jo edges ke through connected hote hain.

👉 Important terms:

• Root – sabse top node

• Parent – jis node ke children hote hain

• Child – jo node parent se connected hota hai

• Leaf Node – jiska koi child nahi hota

• Edge – nodes ko connect karta hai

⚙️ Basic Terminology

Tree ko samajhne ke liye kuch important terms:

• Depth – root se node tak distance

• Height – tree ki maximum depth

• Subtree – kisi node ka chhota tree

• Degree – node ke children ki sankhya

🔄 Types of Trees

1. Binary Tree

Har node ke maximum 2 children hote hain

2. Binary Search Tree (BST)

Left < Root < Right rule follow karta hai

3. Full Binary Tree

Har node ke ya to 0 ya 2 children hote hain

4. Complete Binary Tree

Last level except fully filled hota hai

5. Balanced Tree

Height minimum hoti hai (efficient search ke liye)

💻 Tree Node Structure in C

#include <iostream>

using namespace std;

class Node {

public:

    int data;

    Node* left;

    Node* right;

    Node(int val) {

        data = val;

        left = NULL;

        right = NULL;

    }

};

// Inorder Traversal

void inorder(Node* root) {

    if (root == NULL) return;

    inorder(root->left);

    cout << root->data << " ";

    inorder(root->right);

}

// Preorder Traversal

void preorder(Node* root) {

    if (root == NULL) return;

    cout << root->data << " ";

    preorder(root->left);

    preorder(root->right);

}

// Postorder Traversal

void postorder(Node* root) {

    if (root == NULL) return;

    postorder(root->left);

    postorder(root->right);

    cout << root->data << " ";

}

int main() {

    Node* root = new Node(1);

    root->left = new Node(2);

    root->right = new Node(3);

    root->left->left = new Node(4);

    root->left->right = new Node(5);

    cout << "Inorder: ";

    inorder(root);

    cout << "\nPreorder: ";

    preorder(root);

    cout << "\nPostorder: ";

    postorder(root);

    return 0;

}

👉 Left aur right pointers children ko represent karte hain

🔁 Tree Traversal Techniques

Tree traversal ka matlab hai nodes ko visit karna:

1. Inorder (Left → Root → Right)

2. Preorder (Root → Left → Right)

3. Postorder (Left → Right → Root)

👉 Ye traversal methods interviews me bahut important hain

💡 Example

Binary Tree:

      10

     /  \

    5    15

Inorder traversal:
👉 5 → 10 → 15

📈 Time Complexity

Operation                    Complexity

Search                          O(log n)

Insert                            O(log n)

Delete                           O(log n)

👉 Balanced tree me operations fast hote hain

🎯 Applications of Tree

• File system structure

• Database indexing

• Expression trees

• AI decision making

• Network routing

⚡ Advantages

• Hierarchical data representation

• Efficient searching

• Dynamic structure

❌ Disadvantages

• Complex implementation

• Memory overhead

• Balancing difficult

🔥 Tree vs Linked List

Feature                      Tree                     Linked List

Structure                     Hierarchical           Linear

Access                        Fast                       Slow

Complexity                  High                       Low

💡 Common Mistakes

• Traversal confuse karna

• BST rules ignore karna

• Tree diagram visualize na karna

👉 Tip: Har problem me diagram banao

🚀 How to Master Tree

1. Basics samjho (binary tree)

2. Traversals practice karo

3. BST solve karo

4. Questions practice karo (20+)

Agar aap Tree seekh rahe hain to ye topics bhi zaroor padhein:

• 👉 DSA Roadmap for Beginners in Hindi

• 👉 Stack in Data Structure

• 👉 Queue in Data Structure

• 👉 Linked List in Data Structure

• 👉 Binary Search in Data Structure

• 👉 Recursion in C

👉 Ye sab topics milkar aapki DSA strong banate hain

🏁 Conclusion

Tree ek powerful data structure hai jo complex problems ko efficiently solve karne me help karta hai. Agar aap DSA roadmap follow kar rahe hain to Tree aapka next big step hai.

Consistent practice aur clear concepts ke saath aap Tree ko master kar sakte hain aur coding interviews ke liye strong ban sakte hain.

👉 Complete Roadmap:

https://sites.google.com/view/dsarop/

👉 Next Topic: Graph

https://sites.google.com/view/dsarop/graph