Binary Tree
A binary tree is a rooted tree in which each node has at most two children.
Definition · Example · CSE Use →Definitions, examples and Computer Science applications for this mathematics subject.
A binary tree is a rooted tree in which each node has at most two children.
Definition · Example · CSE Use →A bipartite graph divides vertices into two sets so edges only go between the sets.
Definition · Example · CSE Use →A connected graph has a path between every pair of vertices.
Definition · Example · CSE Use →A cycle is a closed path that starts and ends at the same vertex without repeating other vertices.
Definition · Example · CSE Use →The degree of a vertex is the number of edges incident to it in an undirected graph.
Definition · Example · CSE Use →A directed graph has edges with an orientation from one vertex to another.
Definition · Example · CSE Use →An edge connects two vertices in a graph.
Definition · Example · CSE Use →A graph is a set of vertices connected by edges.
Definition · Example · CSE Use →A minimum spanning tree is a spanning tree with the smallest total edge weight.
Definition · Example · CSE Use →A path is a sequence of adjacent vertices with no repeated vertex in the simplest definition.
Definition · Example · CSE Use →A topological ordering is a linear order of vertices in a directed acyclic graph where every edge points forward in the order.
Definition · Example · CSE Use →A tree is a connected undirected graph with no cycles.
Definition · Example · CSE Use →An undirected graph has edges with no direction.
Definition · Example · CSE Use →A vertex is a node or point in a graph.
Definition · Example · CSE Use →A weighted graph assigns a numerical cost, distance or capacity to edges.
Definition · Example · CSE Use →