zunda @zundan

**Kerrick Long (code)** @kerrick@ruby.social · Feb 13

Kerrick Long (code) @kerrick@ruby.social

Ruby's expressiveness is second to none.

$class BinaryNode attr_accessor :value, :parent, :left, :right include Enumerable def each(...) = each_breadth_first(...) def initialize value, left = nil, right = nil @value, @left, @right = value, left, right children.each { it.parent = self } end def left? = (not left.nil?) def right? = (not right.nil?) def parent? = (not parent.nil?) def root? = parent.nil? def leaf? = (left.nil? and right.nil?) def balanced? = (left? and right?) def all_balanced? = all? { it.balanced? or it.leaf? } def children = [left, right].compact def ancestors = if root? then [] else parent.ancestors + [parent] end def descendants = collect { it.children }.flatten def depth = map { it.ancestors.size }.max + 1 def each_breadth_first(&block) = traverse :push, &block def each_depth_first(&block) = traverse :unshift, &block private def traverse method, &block nodes = [self] until nodes.empty? current = nodes.shift yield current nodes.send(method, *current.children) end end end$

#Ruby #BinaryTree #LeetCode

Recent searches

Search options

Administered by:

Server stats:

#leetcode