DATA STRUCTURE ALGORITHM
1. EXPLAIN WHETHER THE BINARY TREE IN THE IMAGE IS AN AVL OR NON AVL
2. LIST DOWN ALL THE LEAF NODES
3. A NOD WITH INFO 85 IS INSERTED INTI THE TREE. REDRAW THE TREE AFTER INSERTING 85
4. NODE 76 IS DELETED. REDRAW THE TREE AFTER DELETING 76
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here