Binary tree

FIND A SOLUTION AT Academic Writers Bay

1 The distinguished node at the beginning or top of a tree is called the
a head node
b root node
c leaf node
2 A node without children is called a
a single node
b leaf node
3 Each level k in a full binary tree contains
a 2k nodes
b 2k nodes
c 2k – 1 nodes
4 Assume that data are inserted into a binary search tree in the order D B
A C F E G. A preorder traversal would return these data in the order
a D B A C F E G
b A B C D E F G
5 Assume that data are inserted into a binary search tree in the order D B
A C F E G. An inorder traversal would return these data in the order
a D B A C F E G
b A B C D E F G

YOU MAY ALSO READ ...  the corresponding Discrete Time
Order from Academic Writers Bay
Best Custom Essay Writing Services

QUALITY: 100% ORIGINAL PAPERNO PLAGIARISM – CUSTOM PAPER