Scribd
Upload
4 views

1M - Module 4

Related to semiconductor circuits

Uploaded by

123aaditya7012
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

1M - Module 4

Related to semiconductor circuits

Uploaded by

123aaditya7012
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. Root (in a Binary Tree): The root is the topmost node in a binary tree.

It is the node from


which all other nodes descend. In a tree, there is only one root node.

2. Leaf Node (in a Binary Tree): A leaf node is a node that has no children; it is at the end of
a branch of the tree.

3. Binary Tree: A binary tree is a tree data structure in which each node has at most two
children, referred to as the left child and the right child.

4. Time Complexity of Searching in a Binary Search Tree (BST): The time complexity for
searching in a BST is , where is the height of the tree. In the average case, this is , but in
the worst case (unbalanced tree), it can be .

5. Cases to Delete a Node in a BST:

Node has no children (it’s a leaf node).

Node has one child.

Node has two children.

6. Expression Tree: An expression tree is a binary tree that represents an arithmetic


expression. The internal nodes represent operators, and the leaf nodes represent operands.

7. Cycle in a Graph: A cycle in a graph is a path of edges and vertices wherein a vertex is
reachable from itself.

8. Directed Graph: A directed graph, or digraph, is a graph in which the edges have a
direction. This means that each edge goes from one vertex to another specific vertex.

9. Size of Adjacency Matrix with 4 Vertices: The size of the adjacency matrix for a graph with
4 vertices is , or 16 elements.

10. Operations Performed on a Graph:


Add vertex

Remove vertex

Add edge

Remove edge

Traverse the graph (DFS, BFS)

Find the shortest path

Check connectivity

11. Breadth-First Search (BFS): BFS is a graph traversal algorithm that starts at a source
node and explores all neighboring nodes at the present depth before moving on to nodes at
the next depth level.

12. Algorithm to Find the Minimum Spanning Tree (MST) of a Graph:

Prim's Algorithm

Kruskal's Algorithm

You might also like