ternary-tree

Majority tree evaluation Question: Consider a complete ternary tree of depth h, composed of a root attached to three complete ternary trees of depth h – 1. There are n = 3^h leaves and each leaf has a boolean value associated to it. Each internal node, including the root, equals the value of the majority …