Show the splay tree that results from a search 1 operation o

Show the splay tree that results from a search (1) operation on the splay tree from question 16. Based upon the resultant trees form questions 15 - 17, what conclusions can you draw regarding the self-adjusting nature of a splay tree versus a binary search tree? Show the binary heap that results from line insertion of the following numbers into an initially empty heap: 35 - 20 - 30 - 50 - 45 - 60 - 18 - 25 - 42 Show the binary heap that results from a remove () operation performed on the heap in question 19. Draw the heap from question 20 as an array. Describe the use of the following methods form the ObjectBinaryTree class: compareTO() operate() visit()

Solution

Object Binary Tree java class
compareTo()
operate()
visit()

compareTo():
The compareTo() method is used to compare two nodes based on the values those nodes are holding
The compareTo() methods compares the current nodes with the referenced node,
and based uopn the given values, it returns
0, if both nodes are equal
> 0, if first node\'s value is greater than second node\'s value
< 0, if first node\'s value is smaller than second node\'s value
For example, there are two nodes objA and objB
and if objA holds value 10 and objB holds 20
then objA.compareTo(objB) sould return -10
  
operate():
The operate() method is used to do some operation with refrenced node.
For example, in given Object Binary Tree class, the operate() method is used
in insertBSTDup() method, which would insert a duplicate node (say \"objO\")
whereever in the tree it find the same value of \"objO\"
So the tree is traversed until the node having same value as that of \"objO\" is found.
Then the operation (inserting duplicate node) is performed.
  
visit():
The visit() method is used to fetch the data which a tree node holds
It is used in preTrav, inTrav, postTrav methods, which are used to traverse the tree
preTrav =
1 print the value of current node
2 traverse to left child node, unless there are no more left child node
3 traverse to right child node
4 repeat from 1
inTrav =
1 traverse to left child node, unless there are no more left child node
2 print the value of current node
3 traverse to right child node
4 repeat from 1
PostTrav =
1 traverse to left child node, unless there are no more left child node
2 traverse to right child node
3 print the value of current node
4 repeat from 1