0
A binary tree in which every node has either zero or exactly two children (never just one) is called a:
- AComplete binary tree
- BFull binary tree
- CBalanced binary tree
- DSkewed binary tree
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!