👉 Primsie, in the context of computer science and mathematics, refers to a specific type of graph. A Prim's tree is a tree that can be constructed using exactly 2 unique nodes, where each node has at most two children. A Prims' tree is a complete binary tree (a tree with no cycles) if and only if it satisfies the following conditions: 1. Every vertex has degree one. 2. The maximum number of edges in any path from a single vertex to another
