Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

Is there a term to describe all non-root nodes in a tree?

Tags:

terminology

graph

Root covers the root, what are the rest of the nodes collectively called?

like image 860
glenn Avatar asked Jan 16 '11 13:01

glenn

1 Answers

Just like in the real world: branches and leaves

They are all child nodes (of the root or some other node).

like image 59
Axel Fontaine Avatar answered Sep 29 '22 08:09

Axel Fontaine
Sign in to Comment

Related questions

Dealing with Massive Graphs - Traveling Salesperson
Organize boxes horizontally and then vertically in graphviz
Visualize a graph in matlab
MATLAB - Plot time-frequency graph of .wav file
Finding a shortest path in a graph with node and edge weights?
Multiple filled.contour plots in one graph using with par(mfrow=c())
Crab Graphs, Algorithms, Graph Theory, How is this network flow?
Best way to find the most costly path in graph
Do minimum depth, spanning trees algorithms exist?
Boost.Graph how to merge two vertices/contract edge
Gremlin: How do you find vertices without a particular edge?
DFS in boost::graph with changing the graphs content
shortest path with dynamic edge cost (algorithm)
Maximum number of edges in undirected graph with n vertices with k connected components?
Graph with colored edges: shortest paths with at most k color changes?
Numpy Array to Graph
What is the optimal way to create a graph with add_edge_list() method?
Getting the value of a specific element from a different row in gnuplot
What is a good data structure to represent an undirected graph?
Open source graph database

Donate For Us

If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!