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? Data Structure

  • 3
  • 4
  • 5
  • 6
Answer: 4
1825 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. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

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

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

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

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

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

  8. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?

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

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

  11. Binary TREE

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

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

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

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

  16. Identify the best answer for the statement given below“ is any process of arranging items in some sequence and/or in different sets, and accordingly”

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

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

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

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


Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.