Computer Science: An OverviewComputer Science: An Overview truly lives up to its title, providing a timely introduction to the entire computer science discipline. Broad coverage, combined with clear explanations, has made it the leading textbook for the breadth-first course. This book provides a balanced, realistic picture that communicates the dynamics of computer science by presenting topics in a historical perspective in which past developments, the current state of the art, and directions of research are discussed. The coverage of topics such as programming languages, operating systems, algorithms, software engineering, networking, database design, artificial intelligence, and machine architecture result in a complete overview of the field of computer science. |
From inside the book
Results 1-3 of 40
... trees . ) Each position in a tree is called a node ( Figure 8.2 ) . The node at the top is called the root node ( if we turned the drawing upside down , this node would represent the base or root of the tree ) . The nodes at the other ...
... Trees For the purpose of discussing tree storage techniques , we restrict our attention to binary trees , which we recall are trees in which each node has at most two children . Such trees normally are stored in memory using a linked ...
... tree is also easier than it may appear at first . Your intuition may lead you to believe that insertions might require cutting the tree open to allow room for new entries , but actually the node being added can always be attached as a ...