Binary treeAcontainer object with aunique starting nodecalled the root, in whicheach node is capable ofhaving two child nodes,and in which a uniquepath exists from the rootto every other nodeRootThe top node of atree structure; a nodewith no parentLeaf nodeA tree nodethat has no children302Chapter 9Abstract Data Types and AlgorithmsFigure 9.16A binary tree12473568109treeBinary TreesThe vocabulary of trees uses the same vocabulary that we introduced inrelation to the linked implementation. Every position in the tree is a node,which contains both the user’s data and information on where to go to getthe next node.From the computing perspective a binary treeis a container object inwhich each node is capable of having two successor nodes, called children.Each of the children, being nodes in the binary tree, can also have up totwo child nodes, and these children can also have up to two children, andso on, giving the tree its branching structure. The beginning of the tree is a
This is the end of the preview. Sign up
access the rest of the document.