Scribd
Upload
6 views3 pages

Tree Node Definitions and Concepts

The document provides definitions for various terms related to trees and graphs. Key concepts include nodes, edges, degrees, and types of trees and graphs. Each definition is concise, typically ranging from six to eight words.

Uploaded by

OM YADAV
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
6 views3 pages

Tree Node Definitions and Concepts

The document provides definitions for various terms related to trees and graphs. Key concepts include nodes, edges, degrees, and types of trees and graphs. Each definition is concise, typically ranging from six to eight words.

Uploaded by

OM YADAV
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

Definitions from PDF (6 to 8 words)

Node:
Stores data and links to next element.

Root Node:
First node where tree originates from.

Parent Node:
A node with one or more children.

Child Node:
A node linked to parent node.

Leaf Node:
A node with no child nodes.

Internal Node:
A node that is not a leaf.

Edge:
A link connecting two tree nodes.

Path:
Sequence of nodes between two nodes.

Siblings:
Nodes sharing the same parent node.

Null Tree:
A tree with no nodes present.

Degree of Node:
Number of node's children.

Degree of Tree:
Highest degree among all nodes.

Depth of Node:
Steps from root to node.

Descendants:
Nodes reachable from a given node.

Ancestor:
Nodes from root to current node.

In-degree:
Incoming edges count of a node.

Out-degree:
Outgoing edges count of a node.

Forest:
A set of multiple disjoint trees.

Sub Tree:
Child node forming its own tree.

Height:
Longest path from node to leaf.

Depth:
Number of edges from root node.

Binary Tree:
Each node has at most two children.

Skewed Tree:
Tree with only left or right subtree.

Undirected Graph:
Edges without a specific direction.

Directed Graph:
Edges with a defined direction.

Adjacent Vertex:
Nodes connected by a common edge.

Cycle:
A path that starts and ends same.

Complete Graph:
Every vertex connected to all others.

Connected Graph:
A graph where all vertices connect.

Degree of Vertex:
Number of edges incident on vertex.
Isolated Vertex:
A vertex with no connecting edges.

Source Vertex:
Node with zero incoming edges.

Sink Vertex:
Node with zero outgoing edges.

Acyclic Graph:
A graph containing no cycles.

Subgraph:
A part of a larger graph.

Weighted Graph:
Graph with edges having assigned weights.

Pendant Vertex:
Vertex with one in-degree, zero out-degree.

Spanning Tree:
Tree connecting all graph vertices without cycles.

Loop:
An edge connecting a node to itself.

You might also like