What is need for finding minimum spanning tree?

Why does using Prim's method always result in a Minimum Spanning Tree being returned?

Provide the order of node traversals for both Depth-First Search (DFS) and Breadth-First Search (BFS) of the following tree. Explain your reasoning

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA: "The lowest common ancestor is defined between two nodes p and q as the lowest node in t that has both p and q as descendants (where we allow a node to be a descendant of itself)." For example, in the figure from question 1, the LCA between nodes 5 and 46 is 21. You may use the following typedef structure. The function returns the reference of the node that is considered the LCA. typedef struct node_s{ int data; struct node_s * leftchild; struct node _s * rightchild; }node_t;