Data Structures and Objects(Cs203)

Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 1 or 15 8 14 6 Figure (1) Q: Start with the BST in Figure 1, what is the degree of node 12? Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 1 12 1 5 15 4 8 14 6 Figure (1) Q: Start with the BST in Figure 1, what is the height of node 8? Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 1 12 3 1 5 15 & 4 8 14 6 Figure (1) Q: Display the output produced by an inorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 12 og 5 15 4 8 14 6 Figure (1) Q: Which node(s) is(are) the Internal node of this tree? Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 5 1 15 4 8 14 6 Figure (1) Q: Which node(s) is(are) the leaves of this tree? Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 5 15 4 4 8 14 4 6 Figure (1) Q: Display the output produced by an Level/Depth 2. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 1 1 15 4 14 6 Figure (1) Q: Display the output produced by an levelorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 1 5 15 4 8 14 6 Figure (1) Q: Display the output produced by a postorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. Book Chapter 1 Chapter2 Section 1.1 Section 1.2 Section 2.1 Section 2.2 Section 1.2.1 Section 1.2.2 Section 2.2.1 Section 2.2.2 Figure (1) Q: Display the output produced by a postorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 12 1 5 1 15 4 8 14 4 6 Figure (1) Q : Display the output produced by a preorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. Book Chapter 1 Chapter2 Section 1.1 Section 1.2 Section 2.1 Section 2.2 Section 1.2.1 Section 1.2.2 Section 2.2.1 Section 2.2.2 Figure (1) Q : Display the output produced by a preorder traversal. Consider the binary search tree (BST) given in Figure 1, answer related questions that follow. 9 3 1 12 1 5 1 15 4 8 14 6 Figure (1) Q: Which node(s) is(are) the roots of this tree