engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Programming and Data Structure Binary Heap Binary Search Tree
A binary search tree where the subtrees of every node differ in height by at most 1 is called:
1
B+ tree
2
Binary tree
3
Binary search tree
4
AVL tree