Question 1

17.To process data using postorder processing:&#10;A)Node is processed first,then the left branch,then the right.&#10;B)The left branch is processed first,then the node and then the right branch&#10;C)The left branch is processed first,then the right branch,and then the node&#10;D)The right branch is processed first,then the node,and then the left branch.

Accepted Answer

In postorder processing, the left branch is processed first, then the right branch, and finally the node is processed. This is because the node's value may depend on the values of its child nodes, and processing the child nodes first ensures that their values are available before processing the node. Therefore, option C is the correct choice.

Question 2

7.There are teo branches from every node.

Accepted Answer

The statement is incorrect because it assumes a binary structure. In general, nodes can have any number of branches, not limited to two.

Question 3

12.Given the following data,what would the root value be if the tree were transversed as NLR, (Remember the data should be in alphabetical order. ) Dave
Julie
Martha
Adam
Frank
Peter
Norman

A)Julie
B)Adam
C)Martha
D)Peter
E)Norman

A

Accepted Answer

NLR traversal means first visit the root node, then the left subtree and then the right subtree. As the data is sorted alphabetically, the root node will be the first element in the list which is "Dave". However, "Dave" is not given as an option, so we need to look at the next element in the traversal order which is "Julie". Therefore, the root value if the tree were transversed as NLR would be "Julie".

Question 4

9.There are three ways to process binary trees: Preorder,Inorder,and Postorder.

Accepted Answer

Preorder, Inorder, and Postorder are the three ways to process binary trees.

Question 5

16.To process data using inorder processing:&#10;A)Node is processed first,then the left branch,then the right.&#10;B)The left branch is processed first,then the node and then the right branch&#10;C)The left branch is processed first,then the right branch,and then the node&#10;D)The right branch is processed first,then the node,and then the left branch.

Accepted Answer

In inorder processing, the left branch is processed first, then the node and then the right branch. This is because inorder processing follows the pattern of "left-root-right", where we first visit the left subtree, then the root node and finally the right subtree. This pattern ensures that the nodes are visited in ascending order in a binary search tree.

Question 6

11.A binary tree:&#10;A)Has a root node.&#10;B)Each node has no more than two branches.&#10;C)Uses stacks to process the nodes.&#10;D)Uses two extra fields for the pointers to the branches.&#10;E)All of the above.

Accepted Answer

The answer of 11.A binary tree:&#10;A)Has a root node.&#10;B)Each node...

Question 7

8.A binary tree stores data in right brances and left branches.

Accepted Answer

A binary tree is a tree data structure where each node has at most two children, referred to as the left child and the right child. Data can be stored in the nodes or in the leaves of the tree. Therefore, the statement "A binary tree stores data in right branches and left branches" is true.

Question 8

4.A node at a higher level is called parent.

Accepted Answer

A node at a higher level in a tree data structure is called a parent node as it has children below it.

Question 9

10.Hashing is another method of storing and processing data.

Accepted Answer

Hashing is a well-known method of storing and processing data that involves transforming data into a fixed-length value or key. This key can then be used for indexing or searching data quickly.

Question 10

1.The top of a binary tree is a branch.

Accepted Answer

The top of a binary tree is referred to as the root, not a branch.

Question 11

18.Preorder processing is abbreviated as:&#10;A)NLR&#10;B)LNR&#10;C)LRN&#10;D)RNL

Accepted Answer

The answer of 18.Preorder processing is abbreviated as:&#10;A)NLR&#10;B)LNR&#10;C)LRN&#10;D)RNL...

Question 12

3.A binary tree is the same as a linked list.

Accepted Answer

The answer of 3.A binary tree is the same as...

Question 13

6.Stacks are used to process a binary tree.

Accepted Answer

The answer of 6.Stacks are used to process a binary...

Question 14

15.To process data using preorder processing:&#10;A)Node is processed first,then the left branch,then the right.&#10;B)The left branch is processed first,then the node and then the right branch&#10;C)The left branch is processed first,then the right branch,and then the node&#10;D)The right branch is processed first,then the node,and then the left branch.

Accepted Answer

The answer of 15.To process data using preorder processing:&#10;A)Node is...

Question 15

2.A node on a binary tree may be a leaf.

Accepted Answer

The answer of 2.A node on a binary tree may...

Question 16

19.Inorder processing is abbreviated as:&#10;A)NLR&#10;B)LNR&#10;C)LRN&#10;D)RNL

Accepted Answer

The answer of 19.Inorder processing is abbreviated as:&#10;A)NLR&#10;B)LNR&#10;C)LRN&#10;D)RNL...

Question 17

5.The bottom position of the tree is called a root

Accepted Answer

The answer of 5.The bottom position of the tree is...

Deck 12: Binary Trees