Pergunta de entrevista da empresa CME Group
Built methods for a basic BST ie. insert, delete, search, check if BST is valid(left is less, right is greater) and check for duplicates in tree.
Resposta da entrevista
Sigiloso
2 de fev. de 2022
insert just traverses tree using recursion and inserts, delete traverses tree using recursion and reassigns children after deletion, search traverses tree and returns when found or returns null when not, check if valid recurses through tree and checks if every left is less and right is greater, duplicates just puts into hashmap