COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
data structure similar to a graph, with no loops.
|
|
|
an object in a graph also known as a vertex
|
|
|
a join of relationship between nodes-also know as an arc
|
|
|
a tree where each node can only have 2 child nodes attached to it
|
Detailed explanation-1: -In computer science, a binary tree is a structurally complete data structure in which each node has at most two children. A binary tree usually has two nodes, called the left and right nodes, with the left being less than the right. The topmost node in the tree is called the root node.
Detailed explanation-2: -A binary tree where every node has 0 or 2 children, and all levels except possibly the last are full, then this is called a complete binary tree.
Detailed explanation-3: -Perfect Binary Tree A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at the same level.
Detailed explanation-4: -A binary tree is a tree in which no node has more than two children, and every child is either a left child or a right child even if it is the only child its parent has. A full binary tree is one in which every internal node has two children.