📖 1. Pengantar Tree

🆚 Tree vs Struktur Linear

🎖️ Aplikasi Tree

📖 2. Terminologi Tree

Contoh binary tree dengan 7 node

Komponen Dasar Tree

Properti Ukuran Tree

🧠 Quiz: Terminologi

📖 3. Binary Tree

struct Node {
    int data;
    Node* left;   // Pointer ke left child
    Node* right;  // Pointer ke right child
    
    Node(int val) : data(val), left(nullptr), right(nullptr) {}
};
                        

📊 Jenis-jenis Binary Tree

📊 Jenis Binary Tree (lanjutan)

📐 Properti Matematis Binary Tree

📖 4. Representasi Binary Tree

💻 Linked Structure Implementation

struct Node {
    int data;
    Node* left;
    Node* right;
    Node(int val) : data(val), left(nullptr), right(nullptr) {}
};

class BinaryTree {
private:
    Node* root;
public:
    BinaryTree() : root(nullptr) {}
    Node* getRoot() { return root; }
    void setRoot(Node* node) { root = node; }
};

// Penggunaan
int main() {
    BinaryTree tree;
    tree.setRoot(new Node(10));
    tree.getRoot()->left = new Node(5);
    tree.getRoot()->right = new Node(15);
}
                    

📊 Array Representation

Array: [10, 5, 15, 3, 7, 12, 20]

🔢 Formula Indexing (0-based)

⚖️ Perbandingan Representasi

📖 5. Tree Traversal

🔄 Preorder Traversal

💻 Preorder Implementation

void preorder(Node* root) {
    if (root == nullptr) return;
    
    cout << root->data << " ";
    preorder(root->left);
    preorder(root->right);
}
                            

void preorderIterative(Node* root) {
    if (!root) return;
    stack s;
    s.push(root);
    
    while (!s.empty()) {
        Node* curr = s.top();
        s.pop();
        cout << curr->data << " ";
        
        if (curr->right) s.push(curr->right);
        if (curr->left) s.push(curr->left);
    }
}
                            

🔄 Inorder Traversal

💻 Inorder Implementation

void inorder(Node* root) {
    if (root == nullptr) return;
    
    inorder(root->left);         // Traverse subtree kiri
    cout << root->data << " ";   // Kunjungi root
    inorder(root->right);        // Traverse subtree kanan
}
                    

🔄 Postorder Traversal

💻 Postorder Implementation

void postorder(Node* root) {
    if (root == nullptr) return;
    
    postorder(root->left);       // Traverse subtree kiri
    postorder(root->right);      // Traverse subtree kanan
    cout << root->data << " ";   // Kunjungi root
}

// Untuk menghapus tree dengan aman
void deleteTree(Node* root) {
    if (root == nullptr) return;
    
    deleteTree(root->left);
    deleteTree(root->right);
    delete root;  // Hapus setelah children dihapus
}
                    

🔄 Level-order Traversal (BFS)

💻 Level-order Implementation

#include 

void levelOrder(Node* root) {
    if (root == nullptr) return;
    queue q;
    q.push(root);
    
    while (!q.empty()) {
        Node* current = q.front();
        q.pop();
        
        cout << current->data << " ";
        
        if (current->left) q.push(current->left);
        if (current->right) q.push(current->right);
    }
}
                    

📊 Perbandingan Traversal

Kompleksitas: Semua O(n) waktu, O(h) atau O(w) ruang

🧠 Quiz: Traversal

📖 6. Expression Tree

• Leaf nodes: Operand (angka/variabel)
• Internal nodes: Operator (+, -, *, /)

Contoh: (3 + 5) * 2

💻 Build Expression Tree dari Postfix

Node* buildExpressionTree(string postfix) {
    stack st;
    
    for (char c : postfix) {
        if (c == ' ') continue;
        
        Node* node = new Node(c);
        
        if (isdigit(c) || isalpha(c)) {
            // Operand: langsung push
            st.push(node);
        } else {
            // Operator: pop 2 operand sebagai children
            node->right = st.top(); st.pop();
            node->left = st.top(); st.pop();
            st.push(node);
        }
    }
    
    return st.top();  // Root dari expression tree
}
                    

🎖️ 7. Aplikasi Pertahanan

Decision Tree untuk Analisis Ancaman

🎖️ Hierarki Komando

Kegunaan: Representasi struktur organisasi, distribusi perintah, analisis jalur komando