Question

Q4. Graph below represent position of the Nodes. Make each Binary search tree, Min heap tree, AVL tree and answer the questions Binary search tree operations Insert 25 Insert 35 Insert 22 Insert 12 Insert 1 Insert 13 Insert 29 Insert 9 Insert 20 Insert 24 Insert 32 Insert 23 Insert 27 Min heap tree operations (Heapify after every insert) Insert 23 Insert 15 Insert 17 Insert 32 Insert 10 Insert 12 Insert 5 Insert 6 Insert 30 Insert 9 Insert 1 26. [BINARY_TREE] What is the value of Node 1 after all operations (Write NULL if there's no value) 27. [BINARY_TREE] What is the value of Node 5 after all operations (Write NULL if there's no value) 28. [BINARY_TREE] What is the value of Node 7 after all operations (Write NULL if there's no value) 29. [BINARY_TREE] What is the value of Node 17 after all operations (Write NULL if there's no value) 30. [BINARY_TREE] What is the value of Node 18 after all operations (Write NULL if there's no value) 31. [MIN_HEAP] What is the value of Node 1 after all operations (Write NULL if there's no value) 32. [MIN_HEAP] What is the value of Node 2 after all operations (Write NULL if there's no value) 33. [MIN_HEAP] What is the value of Node 6 after all operations (Write NULL if there's no value) 34. [MIN_HEAP] What is the value of Node 11 after all operations (Write NULL if there's no value) 35. [MIN_HEAP] What is the value of Node 12 after all operations (Write NULL if there's no value)

          Q4. Graph below represent position of the Nodes. Make each Binary search tree, Min heap tree, AVL tree and answer the questions
Binary search tree operations
Insert 25
Insert 35
Insert 22
Insert 12
Insert 1
Insert 13
Insert 29
Insert 9
Insert 20
Insert 24
Insert 32
Insert 23
Insert 27
Min heap tree operations
(Heapify after every insert)
Insert 23
Insert 15
Insert 17
Insert 32
Insert 10
Insert 12
Insert 5
Insert 6
Insert 30
Insert 9
Insert 1
26. [BINARY_TREE]
What is the value of Node 1 after all operations
(Write NULL if there's no value)
27. [BINARY_TREE]
What is the value of Node 5 after all operations
(Write NULL if there's no value)
28. [BINARY_TREE]
What is the value of Node 7 after all operations
(Write NULL if there's no value)
29. [BINARY_TREE]
What is the value of Node 17 after all operations
(Write NULL if there's no value)
30. [BINARY_TREE]
What is the value of Node 18 after all operations
(Write NULL if there's no value)
31. [MIN_HEAP]
What is the value of Node 1 after all operations
(Write NULL if there's no value)
32. [MIN_HEAP]
What is the value of Node 2 after all operations
(Write NULL if there's no value)
33. [MIN_HEAP]
What is the value of Node 6 after all operations
(Write NULL if there's no value)
34. [MIN_HEAP]
What is the value of Node 11 after all operations
(Write NULL if there's no value)
35. [MIN_HEAP]
What is the value of Node 12 after all operations
(Write NULL if there's no value)

Q4. Graph below represent position of the Nodes. Make each Binary search tree, Min heap tree, AVL tree and answer the questions
Binary search tree operations
Insert 25
Insert 35
Insert 22
Insert 12
Insert 1
Insert 13
Insert 29
Insert 9
Insert 20
Insert 24
Insert 32
Insert 23
Insert 27
Min heap tree operations
(Heapify after every insert)
Insert 23
Insert 15
Insert 17
Insert 32
Insert 10
Insert 12
Insert 5
Insert 6
Insert 30
Insert 9
Insert 1
26. [BINARYTREE]
What is the value of Node 1 after all operations
(Write NULL if there's no value)
27. [BINARYTREE]
What is the value of Node 5 after all operations
(Write NULL if there's no value)
28. [BINARYTREE]
What is the value of Node 7 after all operations
(Write NULL if there's no value)
29. [BINARYTREE]
What is the value of Node 17 after all operations
(Write NULL if there's no value)
30. [BINARYTREE]
What is the value of Node 18 after all operations
(Write NULL if there's no value)
31. [MINHEAP]
What is the value of Node 1 after all operations
(Write NULL if there's no value)
32. [MINHEAP]
What is the value of Node 2 after all operations
(Write NULL if there's no value)
33. [MINHEAP]
What is the value of Node 6 after all operations
(Write NULL if there's no value)
34. [MINHEAP]
What is the value of Node 11 after all operations
(Write NULL if there's no value)
35. [MINHEAP]
What is the value of Node 12 after all operations
(Write NULL if there's no value)

Added by Deborah L.

Question

Please give Ace some feedback