All Node Pointers That Do Not Point to Other Nodes

Q6: Binary trees may be implemented as templates,

Q9: The binary tree structure is called a

Q10: The height of a tree describes how

Q17: A strong reason to use the binary

Q20: The first node in a binary tree

Q22: When you dereference a pointer to a

Q23: A node that has no children is

Q24: The head pointer, anchored at the top

Q25: Methods of traversing a tree are:<br>A) Inorder

Q29: A binary tree can be created using