Get the two highest number in a binary search tree

Question

F · Accepted Answer

go right until possible -> this is the biggest element.
if the biggest element has a left child, find the most right element in the subtree of this left child (might be itself)
else the parent of the biggest element is the 2nd biggest

Noel · Answer

Can i type

Elno · Answer

F's case will not work in this instance
        5
   1
        4

Do a reverse inorder Traversal saving the two biggest and quit when you find them.

reverseBSTTraverse(node, [], 2)

def reverseBSTTraverse(node, array=[], k=2):

	if len(array) == k:
		print array
		return

	if node == None:
		return

	reverseBSTTraverse(node.right, array , k)
	array.append( node.value )
	reverseBSTTraverse(node.left, array, k )

Google

Google Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches