Write a program that verifies that a binary tree is a binary search tree.

Question

deric · Accepted Answer

void traversal(Node* root){ if(*root== NULL) return; ArrayList thislevel =  new ArrayList; thislevel.add(root) ; while(!thislevel.isempty()){ArrayList nextlevel = new ArrayList; for(Node s in thislevel) { if(s= = NULL)break;if(s>s.leftchild)if(s.rightchild>s){nextlevel.add(left);nextlevel.add(right);}else{return(0);)} thislevel =  nextlevel;}return(1);}

Utilisateur anonyme · Answer

Let the BinaryTree contain 3 variables: value, leftChild, rightChild. The leftChild and the rightChild are again type of BinaryTree only. Now say you are given root node as the argument. At every stage, check if the value of the leftChild is less than current node value which is less than value of rightChild. If it is satisfied, recurse through its children. Otherwise, return "Not a Binary Search Tree"

Bloomberg

Question d’entretien chez Bloomberg

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois