(n *Node)
| 42 | } |
| 43 | |
| 44 | func (parent *Node) AddChild(n *Node) { |
| 45 | n.Parent = parent |
| 46 | n.NextSibling = nil |
| 47 | if parent.FirstChild == nil { |
| 48 | parent.FirstChild = n |
| 49 | n.PrevSibling = nil |
| 50 | } else { |
| 51 | parent.LastChild.NextSibling = n |
| 52 | n.PrevSibling = parent.LastChild |
| 53 | } |
| 54 | |
| 55 | parent.LastChild = n |
| 56 | } |
| 57 | |
| 58 | type NodeNavigator struct { |
| 59 | curr, root *Node |