data structures using true or false ( -way search tree for multiple-choice questions every internal node of an -way search tree consists of pointers to sub-trees and contains how many keys(am (bm- ( (dm+ every node in tree has at most children (am (bm- ( (dm+ which data structure is commonly used to store dictionary(abinary tree (bsplay tree (ctrie (dred black tree in -way search treem stands for (ainternal nodes (bexternal nodes (cdegree of node (dleaf nodes in best casesearching value in binary search tree may take (ao( (bo( log (co(log (do( all leaf nodes in the tree are at the same level btree stores data only in the -nodes tree stores unsorted data every node in the -tree has at most (maximumm- children the leaf nodes of tree are often linked to one another btree stores redundant search key trie is an ordered tree data structure trie uses more space as compared to binary search tree external nodes are called index nodes fill in the blanks an -way search tree consists of pointers to sub-trees and contains keys -tree of order can have maximum of keys and pointers to its sub-trees every node in the -tree except the root node and leaf nodes have at least children in data is stored in internal or leaf nodes balanced tree that has height (log nalways guarantees time for all three methods