A 2 - 3 tree is a type of

Keep practicing — related questions

• If a binary tree contains either two or zero children, then it is called as
• A binary tree whose every node has either zero or two children is called
• Which of the following are Balanced Binary Search Trees?
• In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?
• A complete binary tree with the property that the value at each node is at least as large as the values at ...
• Insert the following elements as binary search tree, 10, 11, 12, 13, 14, 15, 16, 17 and build AVL tree.
• If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the root node is
• ______________ is a tree in which each leaf node is at the same distance from the root.