Skip to content

Hootsuite Certification
- Hootsuite Platform
- Hootsuite Social Marketing
NPTEL
- Data Structures
SEMrush Certification
GYMNASIUM
- Coding For Designers
Google Digital Garage
- Google Digital Garage Quiz
Tools
- Online Word Counter
Blog

Home
About Us
Privacy Policy
Disclaimer
Terms and Conditions
Contact Us

A binary tree whose every node has either zero or two children is called

a) Complete binary tree

b) Binary search tree

c) Extended binary tree

d) None of above

Categories Data Structures

Post navigation

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

The degree of a vertices is the number of _______ to that vertex.

Leave a comment Cancel reply

Comment

Name Email Website

Save my name, email, and website in this browser for the next time I comment.

Hootsuite Certification
- Hootsuite Platform
- Hootsuite Social Marketing
NPTEL
- Data Structures
SEMrush Certification
GYMNASIUM
- Coding For Designers
Google Digital Garage
- Google Digital Garage Quiz
Tools
- Online Word Counter
Blog

© 2021 - Online Certification Guide

AdBlock Detected

Looks like you are using an ad-blocking browser extension. We request you to whitelist our website on the ad-blocking extension and refresh your browser to view the content.