Class: Tree::TreeNode

Inherits:
Object
  • Object
show all
Includes:
Comparable, Enumerable, Utils::CamelCaseMethodHandler, Utils::HashConverter, Utils::JSONConverter, Utils::TreeMergeHandler, Utils::TreeMetricsHandler
Defined in:
lib/tree.rb

Overview

TreeNode Class Description

This class models the nodes for an N-ary tree data structure. The nodes are named, and have a place-holder for the node data (i.e., content of the node). The node names are required to be unique amongst the sibling/peer nodes. Note that the name is implicitly used as an ID within the data structure).

The node's content is not required to be unique across different nodes in the tree, and can be nil as well.

The class provides various methods to navigate the tree, traverse the structure, modify contents of the node, change position of the node in the tree, and to make structural changes to the tree.

A node can have any number of child nodes attached to it and hence can be used to create N-ary trees. Access to the child nodes can be made in order (with the conventional left to right access), or randomly.

The node also provides direct access to its parent node as well as other superior parents in the path to root of the tree. In addition, a node can also access its sibling nodes, if present.

Note that while this implementation does not explicitly support directed graphs, the class itself makes no restrictions on associating a node's content with multiple nodes in the tree. However, having duplicate nodes within the structure is likely to cause unpredictable behavior.

Example

Author:

  • Anupam Sengupta

Direct Known Subclasses

BinaryTreeNode

Core Attributes collapse

Attributes included from Utils::TreeMetricsHandler

#breadth, #depth, #in_degree, #length, #level, #node_depth, #node_height, #out_degree, #size

Node Creation collapse

Structure Modification collapse

Tree Traversal collapse

Navigating the Child Nodes collapse

Navigating the Sibling Nodes collapse

Instance Method Summary collapse

Methods included from Utils::HashConverter

#add_from_hash, included, #to_h

Methods included from Utils::TreeMergeHandler

#merge, #merge!

Methods included from Utils::JSONConverter

#as_json, included, #to_json

Methods included from Utils::CamelCaseMethodHandler

included

Methods included from Utils::TreeMetricsHandler

included

Constructor Details

#initialize(name, content = nil) ⇒ TreeNode

Note:

If the name is an Integer, then the semantics of #[] access method can be surprising, as an Integer parameter to that method normally acts as an index to the children array, and follows the zero-based indexing convention.

Creates a new node with a name and optional content. The node name is expected to be unique within the tree.

The content can be of any type, and defaults to nil.

Parameters:

  • name (Object)

    Name of the node. Conventional usage is to pass a String (Integer names may cause surprises)

  • content (Object) (defaults to: nil)

    Content of the node.

Raises:

  • (ArgumentError)

    Raised if the node name is empty.

See Also:



214
215
216
217
218
219
220
221
222
223
224
225
226
# File 'lib/tree.rb', line 214

def initialize(name, content = nil)
  raise ArgumentError, "Node name HAS to be provided!" if name == nil
  @name, @content = name, content

  if name.kind_of?(Integer)
    warn StandardWarning,
         "Using integer as node name. Semantics of TreeNode[] may not be what you expect! #{name} #{content}"
  end

  self.set_as_root!
  @children_hash = Hash.new
  @children = []
end

Dynamic Method Handling

This class handles dynamic methods through the method_missing method in the class Tree::Utils::CamelCaseMethodHandler

Instance Attribute Details

#contentObject

Content of this node. Can be nil. Note that there is no uniqueness constraint related to this attribute.

See Also:

  • name


120
121
122
# File 'lib/tree.rb', line 120

def content
  @content
end

#has_children?Boolean (readonly)

true if the this node has any child node.

Returns:

  • (Boolean)

    true if child nodes exist.

See Also:



191
192
193
# File 'lib/tree.rb', line 191

def has_children?
  @children.length != 0
end

#has_content?Boolean (readonly)

true if this node has content.

Returns:

  • (Boolean)

    true if the node has content.



150
151
152
# File 'lib/tree.rb', line 150

def has_content?
  @content != nil
end

#is_leaf?Boolean (readonly)

true if this node is a leaf - i.e., one without any children.

Returns:

  • (Boolean)

    true if this is a leaf node.

See Also:



161
162
163
# File 'lib/tree.rb', line 161

def is_leaf?
  !has_children?
end

#is_root?Boolean (readonly)

Returns true if this is a root node. Note that orphaned children will also be reported as root nodes.

Returns:

  • (Boolean)

    true if this is a root node.



142
143
144
# File 'lib/tree.rb', line 142

def is_root?
  @parent.nil?
end

#nameObject

Name of this node. Expected to be unique within the tree.

Note that the name attribute really functions as an ID within the tree structure, and hence the uniqueness constraint is required.

This may be changed in the future, but for now it is best to retain unique names within the tree structure, and use the content attribute for any non-unique node requirements.

If you want to change the name, you probably want to call rename instead.

See Also:

  • content
  • rename


113
114
115
# File 'lib/tree.rb', line 113

def name
  @name
end

#parentObject

Parent of this node. Will be nil for a root node.



124
125
126
# File 'lib/tree.rb', line 124

def parent
  @parent
end

#parentageArray<Tree::TreeNode>? (readonly)

An array of ancestors of this node in reversed order (the first element is the immediate parent of this node).

Returns nil if this is a root node.

Returns:

  • (Array<Tree::TreeNode>)

    An array of ancestors of this node

  • (nil)

    if this is a root node.



173
174
175
176
177
178
179
180
181
182
183
# File 'lib/tree.rb', line 173

def parentage
  return nil if is_root?

  parentage_array = []
  prev_parent = self.parent
  while (prev_parent)
    parentage_array << prev_parent
    prev_parent = prev_parent.parent
  end
  parentage_array
end

#rootTree::TreeNode (readonly)

Root node for the (sub)tree to which this node belongs. A root node's root is itself.

Returns:



131
132
133
134
135
# File 'lib/tree.rb', line 131

def root
  root = self
  root = root.parent while !root.is_root?
  root
end

Instance Method Details

#<<(child) ⇒ Tree::TreeNode

Convenience synonym for #add method.

This method allows an easy mechanism to add node hierarchies to the tree on a given path via chaining the method calls to successive child nodes.

Examples:

Add a child and grand-child to the root

root << child << grand_child

Parameters:

Returns:

See Also:



325
326
327
# File 'lib/tree.rb', line 325

def <<(child)
  add(child)
end

#<=>(other) ⇒ Integer

Provides a comparision operation for the nodes.

Comparision is based on the natural ordering of the node name objects.

Parameters:

Returns:

  • (Integer)

    +1 if this node is a 'successor', 0 if equal and -1 if this node is a 'predecessor'.



872
873
874
875
# File 'lib/tree.rb', line 872

def <=>(other)
  return +1 if other == nil
  self.name <=> other.name
end

#[](name_or_index, num_as_name = false) ⇒ Tree::TreeNode

Note:

The use of Integer names is allowed by using the optional num_as_name flag.

Returns the requested node from the set of immediate children.

  • If the name argument is an Integer, then the in-sequence array of children is accessed using the argument as the index (zero-based). However, if the second optional num_as_name argument is true, then the name is used literally as a name, and NOT as an index

  • If the name argument is NOT an Integer, then it is taken to be the name of the child node to be returned.

If a non-Integer name is passed, and the num_as_name parameter is also true, then a warning is thrown (as this is a redundant use of the num_as_name flag.)

Parameters:

  • name_or_index (String|Number)

    Name of the child, or its positional index in the array of child nodes.

  • num_as_name (Boolean) (defaults to: false)

    Whether to treat the Integer name argument as an actual name, and NOT as an index to the children array.

Returns:

  • (Tree::TreeNode)

    the requested child node. If the index in not in range, or the name is not present, then a nil is returned.

Raises:

  • (ArgumentError)

    Raised if the name_or_index argument is nil.

See Also:



569
570
571
572
573
574
575
576
577
578
579
580
# File 'lib/tree.rb', line 569

def [](name_or_index, num_as_name=false)
  raise ArgumentError, "Name_or_index needs to be provided!" if name_or_index == nil

  if name_or_index.kind_of?(Integer) and not num_as_name
    @children[name_or_index]
  else
    if num_as_name and not name_or_index.kind_of?(Integer)
      warn StandardWarning, "Redundant use of the `num_as_name` flag for non-integer node name"
    end
    @children_hash[name_or_index]
  end
end

#add(child, at_index = -1)) ⇒ Tree::TreeNode

Adds the specified child node to this node.

This method can also be used for grafting a subtree into this node's tree, if the specified child node is the root of a subtree (i.e., has child nodes under it).

this node becomes parent of the node passed in as the argument, and the child is added as the last child (“right most”) in the current set of children of this node.

Additionally you can specify a insert position. The new node will be inserted BEFORE that position. If you don't specify any position the node will be just appended. This feature is provided to make implementation of node movement within the tree very simple.

If an insertion position is provided, it needs to be within the valid range of:

-children.size..children.size

This is to prevent nil nodes being created as children if a non-existant position is used.

Parameters:

  • child (Tree::TreeNode)

    The child node to add.

  • at_index (optional, Number) (defaults to: -1))

    The optional position where the node is to be inserted.

Returns:

Raises:

  • (RuntimeError)

    This exception is raised if another child node with the same name exists, or if an invalid insertion position is specified.

  • (ArgumentError)

    This exception is raised if a nil node is passed as the argument.

See Also:



360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
# File 'lib/tree.rb', line 360

def add(child, at_index = -1)
  raise ArgumentError, "Attempting to add a nil node" unless child # Only handles the immediate child scenario
  raise ArgumentError, "Attempting add node to itself" if self.equal?(child)
  raise ArgumentError, "Attempting add root as a child" if child.equal?(root)

  # Lazy mans unique test, won't test if children of child are unique in this tree too.
  raise "Child #{child.name} already added!" if @children_hash.include?(child.name)

  if insertion_range.include?(at_index)
    @children.insert(at_index, child)
  else
    raise "Attempting to insert a child at a non-existent location (#{at_index}) when only positions from #{insertion_range.min} to #{insertion_range.max} exist."
  end

  @children_hash[child.name]  = child
  child.parent = self
  return child
end

#breadth_each {|node| ... } ⇒ Tree::TreeNode, Enumerator

Performs breadth-first traversal of the (sub)tree rooted at this node. The traversal at a given level is from left-to-right. this node itself is the first node to be traversed.

Yield Parameters:

Returns:

  • (Tree::TreeNode)

    this node, if a block if given

  • (Enumerator)

    an enumerator on this tree, if a block is not given

See Also:



670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
# File 'lib/tree.rb', line 670

def breadth_each(&block)
  return self.to_enum(:breadth_each) unless block_given?

  node_queue = [self]       # Create a queue with self as the initial entry

  # Use a queue to do breadth traversal
  until node_queue.empty?
    node_to_traverse = node_queue.shift
    yield node_to_traverse
    # Enqueue the children from left to right.
    node_to_traverse.children { |child| node_queue.push child }
  end

  return self if block_given?
end

#children {|child| ... } ⇒ Tree::TreeNode+

An array of all the immediate children of this node. The child nodes are ordered “left-to-right” in the returned array.

If a block is given, yields each child node to the block traversing from left to right.

Yield Parameters:

Returns:



696
697
698
699
700
701
702
703
# File 'lib/tree.rb', line 696

def children
  if block_given?
    @children.each {|child| yield child}
    return self
  else
    return @children.clone
  end
end

#detached_copyTree::TreeNode

Returns a copy of this node, with its parent and children links removed. The original node remains attached to its tree.

Returns:



232
233
234
# File 'lib/tree.rb', line 232

def detached_copy
  Tree::TreeNode.new(@name, @content ? @content.clone : nil)
end

#detached_subtree_copyTree::TreeNode Also known as: dup

Returns a copy of entire (sub-)tree from this node.

Returns:

Author:

  • Vincenzo Farruggia

Since:

  • 0.8.0



242
243
244
245
246
# File 'lib/tree.rb', line 242

def detached_subtree_copy
  new_node = detached_copy
  children { |child| new_node << child.detached_subtree_copy }
  new_node
end

#each {|node| ... } ⇒ Tree::TreeNode, Enumerator

Traverses each node (including this node) of the (sub)tree rooted at this node by yielding the nodes to the specified block.

The traversal is depth-first and from left-to-right in pre-ordered sequence.

Yield Parameters:

Returns:

  • (Tree::TreeNode)

    this node, if a block if given

  • (Enumerator)

    an enumerator on this tree, if a block is not given

See Also:



594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
# File 'lib/tree.rb', line 594

def each(&block)             # :yields: node

 return self.to_enum unless block_given?

  node_stack = [self]   # Start with this node

  until node_stack.empty?
    current = node_stack.shift    # Pop the top-most node
    if current                    # The node might be 'nil' (esp. for binary trees)
      yield current               # and process it
      # Stack children of the current node at top of the stack
      node_stack = current.children.clone.concat(node_stack)
    end
  end

  return self if block_given?
end

#each_leaf {|node| ... } ⇒ Tree::TreeNode+

Yields every leaf node of the (sub)tree rooted at this node to the specified block.

May yield this node as well if this is a leaf node. Leaf traversal is depth-first and left-to-right.

Yield Parameters:

Returns:

See Also:



717
718
719
720
721
722
723
724
# File 'lib/tree.rb', line 717

def each_leaf &block
  if block_given?
    self.each { |node| yield(node) if node.is_leaf? }
    return self
  else
    self.select { |node| node.is_leaf?}
  end
end

#first_childTree::TreeNode

First child of this node. Will be nil if no children are present.

Returns:



734
735
736
# File 'lib/tree.rb', line 734

def first_child
  children.first
end

#first_siblingTree::TreeNode

First sibling of this node. If this is the root node, then returns itself.

'First' sibling is defined as follows:

First sibling

The left-most child of this node's parent, which may be this node itself

Returns:

See Also:



758
759
760
# File 'lib/tree.rb', line 758

def first_sibling
  is_root? ? self : parent.children.first
end

#freeze_tree!Object

Freezes all nodes in the (sub)tree rooted at this node.

The nodes become immutable after this operation. In effect, the entire tree's structure and contents become read-only and cannot be changed.



529
530
531
# File 'lib/tree.rb', line 529

def freeze_tree!
  each {|node| node.freeze}
end

#is_first_sibling?Boolean

Returns true if this node is the first sibling at its level.

Returns:

  • (Boolean)

    true if this is the first sibling.

See Also:



768
769
770
# File 'lib/tree.rb', line 768

def is_first_sibling?
  first_sibling == self
end

#is_last_sibling?Boolean

Returns true if this node is the last sibling at its level.

Returns:

  • (Boolean)

    true if this is the last sibling.

See Also:



792
793
794
# File 'lib/tree.rb', line 792

def is_last_sibling?
  last_sibling == self
end

#is_only_child?Boolean

true if this node is the only child of its parent.

As a special case, a root node will always return true.

Returns:

  • (Boolean)

    true if this is the only child of its parent.

See Also:



827
828
829
# File 'lib/tree.rb', line 827

def is_only_child?
  is_root? ? true : parent.children.size == 1
end

#last_childTree::TreeNode

Last child of this node. Will be nil if no children are present.

Returns:



742
743
744
# File 'lib/tree.rb', line 742

def last_child
  children.last
end

#last_siblingTree::TreeNode

Last sibling of this node. If this is the root node, then returns itself.

'Last' sibling is defined as follows:

Last sibling

The right-most child of this node's parent, which may be this node itself

Returns:

See Also:



782
783
784
# File 'lib/tree.rb', line 782

def last_sibling
  is_root? ? self : parent.children.last
end

#marshal_dumpObject

Returns a marshal-dump represention of the (sub)tree rooted at this node.



256
257
258
# File 'lib/tree.rb', line 256

def marshal_dump
  self.collect { |node| node.create_dump_rep }
end

#marshal_load(dumped_tree_array) ⇒ Object

TODO:

This method probably should be a class method. It currently clobbers self and makes itself the root.

Loads a marshalled dump of a tree and returns the root node of the reconstructed tree. See the Marshal class for additional details.



277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
# File 'lib/tree.rb', line 277

def marshal_load(dumped_tree_array)
  nodes = { }
  dumped_tree_array.each do |node_hash|
    name        = node_hash[:name]
    parent_name = node_hash[:parent]
    content     = Marshal.load(node_hash[:content])

    if parent_name then
      nodes[name] = current_node = Tree::TreeNode.new(name, content)
      nodes[parent_name].add current_node
    else
      # This is the root node, hence initialize self.
      initialize(name, content)

      nodes[name] = self    # Add self to the list of nodes
    end
  end
end

#next_siblingTree::treeNode

Next sibling for this node. The next node is defined as the node to right of this node.

Will return nil if no subsequent node is present, or if this is a root node.

Returns:

  • (Tree::treeNode)

    the next sibling node, if present.

See Also:



840
841
842
843
844
845
# File 'lib/tree.rb', line 840

def next_sibling
  return nil if is_root?

  myidx = parent.children.index(self)
  parent.children.at(myidx + 1) if myidx
end

#postordered_each {|node| ... } ⇒ Tree::TreeNode, Enumerator

Traverses the (sub)tree rooted at this node in post-ordered sequence.

Yield Parameters:

Returns:

  • (Tree::TreeNode)

    this node, if a block if given

  • (Enumerator)

    an enumerator on this tree, if a block is not given

See Also:



634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
# File 'lib/tree.rb', line 634

def postordered_each(&block)
  return self.to_enum(:postordered_each) unless block_given?

  # Using a marked node in order to skip adding the children of nodes that
  # have already been visited. This allows the stack depth to be controlled,
  # and also allows stateful backtracking.
  markednode = Struct.new(:node, :visited)
  node_stack = [markednode.new(self, false)] # Start with self

  until node_stack.empty?
    peek_node = node_stack[0]
    if peek_node.node.has_children? and not peek_node.visited
      peek_node.visited = true
      # Add the children to the stack. Use the marking structure.
      marked_children = peek_node.node.children.map {|node| markednode.new(node, false)}
      node_stack = marked_children.concat(node_stack)
      next
    else
      yield node_stack.shift.node           # Pop and yield the current node
    end
  end

  return self if block_given?
end

#preordered_each {|node| ... } ⇒ Tree::TreeNode, Enumerator

Traverses the (sub)tree rooted at this node in pre-ordered sequence. This is a synonym of #each.

Yield Parameters:

Returns:

  • (Tree::TreeNode)

    this node, if a block if given

  • (Enumerator)

    an enumerator on this tree, if a block is not given

See Also:



622
623
624
# File 'lib/tree.rb', line 622

def preordered_each(&block)  # :yields: node
  each(&block)
end

#previous_siblingTree::treeNode

Previous sibling of this node. Previous node is defined to be the node to left of this node.

Will return nil if no predecessor node is present, or if this is a root node.

Returns:

  • (Tree::treeNode)

    the previous sibling node, if present.

See Also:



856
857
858
859
860
861
# File 'lib/tree.rb', line 856

def previous_sibling
  return nil if is_root?

  myidx = parent.children.index(self)
  parent.children.at(myidx - 1) if myidx && myidx > 0
end

Pretty prints the (sub)tree rooted at this node.

Parameters:

  • level (Integer) (defaults to: 0)

    The indentation level (4 spaces) to start with.

  • max_depth (Integer) (defaults to: nil)

    optional maximum depth at which the printing with stop.

  • block (Proc) (defaults to: lambda { |node, prefix| puts "#{prefix} #{node.name}" })

    optional block to use for rendering



882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
# File 'lib/tree.rb', line 882

def print_tree(level = 0, max_depth = nil, block = lambda { |node, prefix|  puts "#{prefix} #{node.name}" })
  prefix = ''

  if is_root?
    prefix << '*'
  else
    prefix << '|' unless parent.is_last_sibling?
    prefix << (' ' * (level - 1) * 4)
    prefix << (is_last_sibling? ? '+' : '|')
    prefix << '---'
    prefix << (has_children? ? '+' : '>')
  end

  block.call(self, prefix)

  return unless max_depth.nil? || level < max_depth # Exit if the max level is defined, and reached.

  children { |child| child.print_tree(level + 1, max_depth, block) if child } # Child might be 'nil'
end

#remove!(child) ⇒ Tree::TreeNode

Removes the specified child node from this node.

This method can also be used for pruning a sub-tree, in cases where the removed child node is the root of the sub-tree to be pruned.

The removed child node is orphaned but accessible if an alternate reference exists. If accessible via an alternate reference, the removed child will report itself as a root node for its sub-tree.

Parameters:

Returns:

  • (Tree::TreeNode)

    The removed child node, or nil if a nil was passed in as argument.

See Also:



468
469
470
471
472
473
474
475
# File 'lib/tree.rb', line 468

def remove!(child)
  return nil unless child

  @children_hash.delete(child.name)
  @children.delete(child)
  child.set_as_root!
  child
end

#remove_all!Tree::TreeNode

Removes all children from this node. If an independent reference exists to the child nodes, then these child nodes report themselves as roots after this operation.

Returns:

See Also:



508
509
510
511
512
513
514
# File 'lib/tree.rb', line 508

def remove_all!
  @children.each { |child| child.set_as_root! }

  @children_hash.clear
  @children.clear
  self
end

#remove_from_parent!Tree:TreeNode

Removes this node from its parent. This node becomes the new root for its subtree.

If this is the root node, then does nothing.

Returns:

  • (Tree:TreeNode)

    self (the removed node) if the operation is successful, nil otherwise.

See Also:



497
498
499
# File 'lib/tree.rb', line 497

def remove_from_parent!
  @parent.remove!(self) unless is_root?
end

#rename(new_name) ⇒ Object

Renames the node and updates the parent's reference to it

Parameters:

  • new_name (Object)

    Name of the node. Conventional usage is to pass a String (Integer names may cause surprises)

Returns:

  • (Object)

    The old name



394
395
396
397
398
399
400
401
402
403
404
# File 'lib/tree.rb', line 394

def rename(new_name)
  old_name = @name

  if is_root?
    self.name=(new_name)
  else
    @parent.rename_child old_name, new_name
  end

  old_name
end

#rename_child(old_name, new_name) ⇒ Object

Renames the specified child node

Parameters:

  • old_name (Object)

    old Name of the node. Conventional usage is to pass a String (Integer names may cause surprises)

  • new_name (Object)

    new Name of the node. Conventional usage is to pass a String (Integer names may cause surprises)

Raises:

  • (ArgumentError)


413
414
415
416
417
418
# File 'lib/tree.rb', line 413

def rename_child(old_name, new_name)
  raise ArgumentError, "Invalid child name specified: " + old_name unless @children_hash.has_key?(old_name)

  @children_hash[new_name] = @children_hash.delete(old_name)
  @children_hash[new_name].name=(new_name)
end

#replace!(old_child, new_child) ⇒ Tree::TreeNode

Replaces the specified child node with another child node on this node.

Parameters:

Returns:



436
437
438
439
440
441
442
443
# File 'lib/tree.rb', line 436

def replace!(old_child, new_child)
  child_index = @children.find_index(old_child)

  old_child = remove! old_child
  add new_child, child_index

  return old_child
end

#replace_with(node) ⇒ Tree::TreeNode

Replaces the node with another node

Parameters:

Returns:



450
451
452
# File 'lib/tree.rb', line 450

def replace_with(node)
  @parent.replace!(self, node)
end

#siblings {|sibling| ... } ⇒ Array<Tree::TreeNode>, Tree::TreeNode

An array of siblings for this node. This node is excluded.

If a block is provided, yields each of the sibling nodes to the block. The root always has nil siblings.

Yield Parameters:

Returns:

  • (Array<Tree::TreeNode>)

    Array of siblings of this node. Will return an empty array for root

  • (Tree::TreeNode)

    This node, if no block is given

See Also:



808
809
810
811
812
813
814
815
816
817
818
# File 'lib/tree.rb', line 808

def siblings
  if block_given?
    parent.children.each { |sibling| yield sibling if sibling != self }
    return self
  else
    return [] if is_root?
    siblings = []
    parent.children {|my_sibling| siblings << my_sibling if my_sibling != self}
    siblings
  end
end

#to_sString

Returns string representation of this node. This method is primarily meant for debugging purposes.

Returns:

  • (String)

    A string representation of the node.



302
303
304
305
306
307
308
# File 'lib/tree.rb', line 302

def to_s
  "Node Name: #{@name}" +
    " Content: " + (@content.to_s || "<Empty>") +
    " Parent: " + (is_root?()  ? "<None>" : @parent.name.to_s) +
    " Children: #{@children.length}" +
    " Total Nodes: #{size()}"
end