A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called Data Structure

  • AVL tree
  • Red-black tree
  • Lemma tree
  • None of the above
Answer: AVL tree
1446 students attemted this question.


No Explanation Available.

Share this question with friends

Similar Questions

  1. Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

  2. Given a sequence of number below: 50,60,40,70,45,55,30,80,65,35,25,75,85When creating a binary search tree, what is the height of the tree?

  3. A Balanced Tree has equal number of items on each subtree.

  4. Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

  5. Which of the following tree data structures is not a balanced binary tree?

  6. A Kind of tree where every node in a tree can have at most two children.

  7. A terminal node in a binary tree is called __________

  8. In this type of search, a sequential search is made over all items one by one.

  9. Complexity of Binary Search for an array of n numbers is

  10. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

  11. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

  12. If node N is a terminal node in a binary tree then its ________

  13. Binary TREE

  14. In preorder traversal of a binary tree the second step is ____________

  15. When traversing a binary tree, which diagram is post-order?

  16. When traversing a binary tree, which diagram is pre-order?

  17. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)

  18. The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)

  19. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

  20. What is the best case height of a B-tree of order n and which has k keys?


Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.