Appeal No. 2002-2237 Page 8
Application No. 09/336,046
backward pointers to move forward through a linked list is
counter intuitive and makes the implementation of a linked list
in content addressable memory nonobvious.”
From our review of Holtz, we find that the graphic network
displayed in figure 2 is in the form of a tree structure. We
agree with the examiner (answer, pages 5 and 6) that:
Holtz shows a tree implemented (fig. 2 and fig. 3)
in a "content addressable memory" or cam (fig. 4,
index 12). One of ordinary skill in the art at
the time of the invention would have a knowledge
of the data structures known as trees and those
known as linked lists. He would know the trees
are commonly made of nodes linked by pointers,
starting at a route [sic, root] node which would
provide links to one or more child nodes and each
of the child nodes capable of having multiple child
nodes. The tree forming branched chains of nodes
terminating in leaf nodes which have no further
children. One of ordinary skill in the art would
know the linked lists are also a [sic] common data
structures which start ant [sic, at] a head which is
linked to another node which may be linked to still
another. The linked list forming a single chain of
nodes, which terminates in an end node. One of
ordinary skill in the art would realize that a linked
list is related to a tree, in effect being a simplified
tree as it does not allow branching. One of ordinary
skill in the art would realize that the links in trees
are pointers the same as they are in linked lists.
Also that the same modifications which are
favorable applied to links in trees could also
favorable be applied in lists.
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 Next
Last modified: November 3, 2007