David L Matuszek-Binary Trees.pptVIP

Binary Trees Linear data structures Here are some of the data structures we have studied so far: Arrays Singly-linked lists and doubly-linked lists Stacks, queues, and deques Sets These all have the property that their elements can be adequately displayed in a straight line Binary trees are one of the simplest nonlinear data structures Parts of a binary tree A binary tree is composed of zero or more nodes Each node contains: A value (some sort of data item) A reference or pointer to a left child (may be null), and A reference or pointer to a right child (may be null) A binary tree may be empty (contain no nodes) If not empty, a binary tree has a root node Every node in the binary tree is reachable from the root node by a unique path A node with neither a left child nor a right child is called a leaf In some binary trees, only the leaves contain a value Picture of a binary tree Size and depth The size of a binary tree is the number of nodes in it This tree has size 12 The depth of a node is its distance from the root a is at depth zero e is at depth 2 The depth of a binary tree is the depth of its deepest node This tree has depth 4 Balance A binary tree is balanced if every level above the lowest is “full” (contains 2n nodes) In most applications, a reasonably balanced binary tree is desirable Binary search in an array Look at array location (lo + hi)/2 Tree traversals A binary tree is defined recursively: it consists of a root, a left subtree, and a right subtree To traverse (or walk) the binary tree is to visit each node in the binary tree exactly once Tree traversals are naturally recursive Since a binary tree has three “parts,” there are six possible ways to traverse the binary tree: root, left, right left, root, right left, right, root root, right, left right, root, left right, left, root Preorder traversal In preorder, the root is visited first Here’s a preorder traversal to print out all the elements in the binary tree: public void preorderPrint(BinaryTree