# final practice 3

 Every binary tree is a binary search tree. false Every binary search tree is a tree. True because every node has two children except for the leaves Every binary search tree is a binary tree. True, A node in a binary tree must have two children False, a node can have not children. A node in a binary tree can have more than one parent False, a node can only have one parent . Each node of a binary search tree has a parent False, the root doesnâ€™t have a parent. . In a binary search tree the info in all of the nodes in the left subtree of a node are less than the info in all of the nodes in the right subtree of the node. True, binary search tree must follow that order. A preorder traversal of a binary search tree processes the nodes in the tree in the exact reverse order that a postorder traversal processes them. False, is not a direct reverse. maximum number of levels that a binary search tree with 100 nodes can have? 100 levels. minimum number of levels that a binary search tree with 100 nodes can have? 7 maximum total number of nodes in a binary tree that has N levels? (Remember that the root is level 0.) 2^n-1 maximum number of nodes in the Nth level of a binary tree? 2^n number of ancestors of a node in the Nth level of a binary search tree? N ancestors number of different binary trees that can be made from three nodes that contain the key values 1, 2, and 3? 5 x 6 = 30 number of different binary search trees that can be made from three nodes that contain the key values 1, 2, and 3? 5 different types because binary search trees has to be in ordered. Authorlcsanc14 ID344112 Card Setfinal practice 3 Descriptionfinal test Updated2018-12-10T07:33:02Z Show Answers