What is a Tree?

A tree is a hierarchical data structure consisting of nodes, with a root node and sub-nodes forming a parent-child relationship. It is used to represent hierarchical relationships, like file systems or organizational structures.

Types of Trees

• Binary Tree: Each node has at most two children (left and right).

• Binary Search Tree: Each node has at most two children (left and right).

• Balanced Tree: Each node has at most two children (left and right).

Basic Operations (Tree)

• Traversal: Visiting each node in a specific order.

• In-order Traversal: Left subtree, root, right subtree.

• Pre-order Traversal: Root, left subtree, right subtree.

• Post-order Traversal: Left subtree, right subtree, root.

What is a Graph?

• A graph is a data structure consisting of nodes (vertices) and edges (connections between nodes). It can represent various relationships like social networks or transportation systems.

Types of Graphs

• Undirected Graph: Edges have no direction.

• Directed Graph: Edges have a direction.

• Weighted Graph: Edges have weights representing costs or distances.

Basic Operations (Graph)

• Traversal: Visiting nodes in the graph.

• Depth-First Search (DFS): Visits nodes by exploring as far as possible along each branch.

• Breadth-First Search (BFS): Visits nodes level by level from the starting node.

Activity

• Draw and label different types of trees and graphs. Implement basic operations like traversals in a programming language of your choice.

Quiz