AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
Any node that does not have ch...
Any node that does not have child nodes are also called
empty nodes
internal nodes
leaf nodes
Correct
single nodes
Similar ITE-6201 questions
Any node of a tree that has child node
An electronic address book ordered by name
Graph G is if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
A connected graph T without any cycles is called a .
A connected graph T without any cycles is called .