A non-leaf node is called an internal node. Some trees only store data in internal nodes, though this affects the dynamics of storing data in the tree. For example, with empty leaves, one can store an empty tree with a single leaf node. However with leaves that can store data, it is impossible to store an empty tree unless one stores some kind of marker data in the leaf that signifies that the leaf is to be empty (and thus the tree to be empty as well).
Conversely, some trees only store data in the leaf nodes, and use the internal nodes to hold other metadata, such as the range of values in the subtree rooted at that node. This type of tree is useful for range queries.
US Patent Issued to Oracle America on Nov. 27 for "Broadband Wavelength-Selective Bidirectional 3-Way Optical Splitter" (California, Texas Inventors)
Nov 29, 2012; ALEXANDRIA, Va., Nov. 29 -- United States Patent no. 8,320,761, issued on Nov. 27, was assigned to Oracle America Inc. (Redwood...
US Patent Issued to Sprint Communications on Sept. 11 for "System and Method for Voip Firewall Security" (Kansas Inventor)
Sep 12, 2012; ALEXANDRIA, Va., Sept. 12 -- United States Patent no. 8,266,686, issued on Sept. 11, was assigned to Sprint Communications Co. LP...