Class: Tree::BinaryTreeNode

Inherits:
TreeNode show all
Defined in:
lib/tree/binarytree.rb

Overview

Provides a Binary tree implementation. This node allows only two child nodes (left and right child). It also provides direct access to the left or right child, including assignment to the same.

This inherits from the TreeNode class.

Author:

  • Anupam Sengupta

Core Attributes collapse

Instance Attribute Summary collapse

Structure Modification collapse

Constructor Details

This class inherits a constructor from Tree::TreeNode

Dynamic Method Handling

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

Instance Attribute Details

#breadthInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Breadth of the tree at this node's level. A single node without siblings has a breadth of 1.

Breadth is defined to be:

Breadth

Number of sibling nodes to this node + 1 (this node itself),

i.e., the number of children the parent of this node has.

Returns:

  • (Integer)

    breadth of the node's level.

#depthInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Deprecated.

This method returns an incorrect value. Use the

Depth of the tree from this node. A single leaf node has a depth of 1.

This method is DEPRECATED and may be removed in the subsequent releases. Note that the value returned by this method is actually the:

height + 1 of the node, NOT the depth.

For correct and conventional behavior, please use #node_depth and #node_height methods instead.

#node_depth method instead.

Returns:

  • (Integer)

    depth of the node.

See Also:

#in_degreeInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

The incoming edge-count of this node.

In-degree is defined as:

In-degree

Number of edges arriving at the node (0 for root, 1 for

all other nodes)

  • In-degree = 0 for a root or orphaned node

  • In-degree = 1 for a node which has a parent

Returns:

  • (Integer)

    The in-degree of this node.

#is_left_child?Boolean

true if the receiver node is the left child of its parent. Always returns false if it is a root node.

Returns:

  • (Boolean)

    true if this is the left child of its parent.



86
87
88
89
# File 'lib/tree/binarytree.rb', line 86

def is_left_child?
  return false if is_root?
  self == parent.left_child
end

#is_right_child?Boolean (readonly)

true if the receiver node is the right child of its parent. Always returns false if it is a root node.

Returns:

  • (Boolean)

    true if this is the right child of its parent.



96
97
98
99
# File 'lib/tree/binarytree.rb', line 96

def is_right_child?
  return false if is_root?
  self == parent.right_child
end

#left_childTree::BinaryTreeNode

Left child of the receiver node. Note that left Child == first Child.

Returns:

See Also:



63
64
65
# File 'lib/tree/binarytree.rb', line 63

def left_child
  children.first
end

#lengthInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Deprecated.

This method name is ambiguous and may be removed. Use

Convenience synonym for #size.

#size instead.

Returns:

  • (Integer)

    The total number of nodes in this (sub)tree.

See Also:

#levelObject (readonly) Originally defined in module Utils::TreeMetricsHandler

Alias for #node_depth

See Also:

#node_depthInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Depth of this node in its tree. Depth of a node is defined as:

Depth

Length of the node's path to its root. Depth of a root node is

zero.

Note that the deprecated method #depth was incorrectly computing this value. Please replace all calls to the old method with #node_depth instead.

#level is an alias for this method.

Returns:

  • (Integer)

    Depth of this node.

#node_heightInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Height of the (sub)tree from this node. Height of a node is defined as:

Height

Length of the longest downward path to a leaf from the node.

  • Height from a root node is height of the entire tree.

  • The height of a leaf node is zero.

Returns:

  • (Integer)

    Height of the node.

#out_degreeInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

The outgoing edge-count of this node.

Out-degree is defined as:

Out-degree

Number of edges leaving the node (zero for leafs)

Returns:

  • (Integer)

    The out-degree of this node.

#right_childTree::BinaryTreeNode

Right child of the receiver node. Note that right child == last child unless there is only one child.

Returns nil if the right child does not exist.

Returns:

See Also:



77
78
79
# File 'lib/tree/binarytree.rb', line 77

def right_child
  children[1]
end

#sizeInteger (readonly) Originally defined in module Utils::TreeMetricsHandler

Total number of nodes in this (sub)tree, including this node.

Size of the tree is defined as:

Size

Total number nodes in the subtree including this node.

Returns:

  • (Integer)

    Total number of nodes in this (sub)tree.

Instance Method Details

#add(child) ⇒ Object

Adds the specified child node to the receiver node. The child node's parent is set to be the receiver.

The child nodes are added in the order of addition, i.e., the first child added becomes the left node, and the second child added will be the second node.

If only one child is present, then this will be the left child.

Parameters:

Raises:

  • (ArgumentError)

    This exception is raised if two children are already present.



116
117
118
119
120
# File 'lib/tree/binarytree.rb', line 116

def add(child)
  raise ArgumentError, 'Already has two child nodes' if @children.size == 2

  super(child)
end

#add_from_hash(hashed_subtree) ⇒ Array

Instantiate and insert child nodes from data in a Ruby Hash

This method is used in conjunction with TreeNode.from_hash to provide a convenient way of building and inserting child nodes present in a Ruby hashes.

This method will instantiate a TreeNode instance for each top- level key of the input hash, to be inserted as children of the receiver instance.

Nested hashes are expected and further child nodes will be created and added accordingly. If a hash key is a single value that value will be used as the name for the node. If a hash key is an Array, both node name and content will be populated.

A leaf element of the tree should be represented as a hash key with corresponding value nil or {}.

>

Examples:

root = Tree::TreeNode.new(:A, "Root content!")
root.add_from_hash({:B => {:D => {}}, [:C, "C content!"] => {}})

Parameters:

  • hashed_subtree (Hash)

    The hash of child subtrees.

Returns:

  • (Array)

    Array of child nodes added

Raises:

  • (ArgumentError)

    This exception is raised if hash contains too many children.

  • (ArgumentError)

    This exception is raised if a non-hash is passed.



152
153
154
155
156
# File 'lib/tree/binarytree.rb', line 152

def add_from_hash(hashed_subtree)
  raise ArgumentError, 'Too many children'\
                       if hashed_subtree.size + @children.size > 2
  super(hashed_subtree)
end

#inordered_each(&block) {|node| ... } ⇒ Tree::BinaryTreeNode, Enumerator

Performs in-order traversal (including this node).

noinspection RubyUnusedLocalVariable

Parameters:

  • block (Object)

Yield Parameters:

Returns:

  • (Tree::BinaryTreeNode)

    This node, if a block is given

  • (Enumerator)

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

See Also:

Since:

  • 0.9.0



173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
# File 'lib/tree/binarytree.rb', line 173

def inordered_each(&block)

  return self.to_enum unless block_given?

  node_stack = []
  current_node = self

  until node_stack.empty? and current_node == nil
    if current_node
      node_stack.push(current_node)
      current_node = current_node.left_child
    else
      current_node = node_stack.pop
      yield current_node
      current_node = current_node.right_child
    end
  end

  self if block_given?

end

#swap_childrenObject

Swaps the left and right child nodes of the receiver node with each other.



247
248
249
# File 'lib/tree/binarytree.rb', line 247

def swap_children
  self.left_child, self.right_child = self.right_child, self.left_child
end