Home Terms and Types Binary Trees Traversals Quiz

Binary Trees: A binary tree has a finite set of nodes that are either empty or consist of exactly one root node and at most two disjoint binary trees (left and right). – Each node may have at most two children. - Each node has a value - the left subtree of a node contains only values less than the node's value; - the right subtree of a node contains only values greater than or equal to the node's value