A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called Data Structure
Answer: AVL tree
No Explanation Available.
Share this question with friends
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?
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?
A Balanced Tree has equal number of items on each subtree.
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
Which of the following tree data structures is not a balanced binary tree?
A Kind of tree where every node in a tree can have at most two children.
A terminal node in a binary tree is called __________
In this type of search, a sequential search is made over all items one by one.
Complexity of Binary Search for an array of n numbers is
B-tree of order n is a order-n multiway tree in which each non-root node contains __________
B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
If node N is a terminal node in a binary tree then its ________
In preorder traversal of a binary tree the second step is ____________
When traversing a binary tree, which diagram is post-order?
When traversing a binary tree, which diagram is pre-order?
A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)
A B-tree of order 4 and of height 3 will have a maximum of _______ keys.
What is the best case height of a B-tree of order n and which has k keys?