Google – Generate All Full Trees with N Leaves / h Height


Google – Generate All Full Trees with N Leaves / h Height
n leaves的full tree有多少种可能性? 输出所有full tree?
h heights的full tree有多少种可能性? 输出所有full tree?
[Analysis]
(1) a什么是full tree?
Full tree是一种binary tree, 其中每个node,要么没有children,要么就有两个children。
(2) Full tree和Complete tree的区别?
Complete tree除了最后一层,其他层都必须是满的,而full tree没有这种规定。
另外Complete tree可以出现只有一个child的情况,而full tree不允许。
(3) Full tree有哪些特点?
如果full tree有n个leaves,那么total number of nodes = 2 * n – 1.
(4) 怎么证明?
简单的方法:
可以想象成一个1 v 1的game, 比到最后只会有一个大赢家,那么就会有 n – 1个internal node, 因为除了最后的赢家,其他每个玩家只会输一次且仅有一次。
严格的方法:
数学归纳法,假设n – 1个leaves成立,有2 * (n – 1) – 1 = 2 * n – 3个nodes。如果要新增加一个leaf,因为full tree的特性,必须加入两个children到其中一个leaf上,这样leaves减一加二就等于n,那么总共的node数量就+2, 2 * n – 3 + 2 = 2 * n – 1.

[Solution]
[#1 Solution]
方法类似于leetcode的unique binary tree,对于root来说,如果left subtree包含k个leaves, 那么right subtree就必须包含n – k个leaves. 无需考虑奇偶的情况,因为奇数leaves也一样能组成一棵full tree.
T(n) = T(k) + T(n – k), k ∈ [1, n – 1]
[#2 Solution]
固定height的做法有点难,因为对于root来说,只需要left subtree或者right subtree其中之一的height为h – 1就可以了。比如left subtree的height为h – 1,那么对于right subtree,它的高度可以是[1, h – 1]之间的任何一个值。另外对于root,left和right subtree属于对称的情况。
T(n) = 2 * T(n – 1) * (T(1) + T(2) + … + T(n – 1)) – T(n – 1) * T(n – 1)
left/right subtree 高度都为h – 1的情况算了两次,所以要减掉一次。
[Note]
第二题的code有一点要特别注意,因为left subtree和right subtree是属于对称情况,一开始直接两种对称情况一起加入到leftSub和rightSub的lists里面,再通过两层for循环建当前的tree。
但是这样会出现bug,比如高度为1的left subtree会和高度也为1的right subtree组成新的tree。这样是不对的,高度为1的left subtree只能和高度为h – 1的right subtree组成新tree。
还有一点optimization是写这篇Post的时候才想到的,Solution2里面第57和第71两行可以放到for loop外面,可以省掉不少递归。(因为这两行递归h – 1,递归里还有n多递归呢)。



Code是输出所有full tree,计算数量可以通过上面递推式求得。
// n leaf nodes
class Solution {
  public List<TreeNode> allFullTrees(int n) {
    List<TreeNode> result = new ArrayList<>();
    if (n == 0) {
      return result;
    }
    if (n == 1) {
      result.add(new TreeNode(1));
      return result;
    }
 
    for (int i = 1; i < n; i++) {
      List<TreeNode> leftSub = allFullTrees(i);
      List<TreeNode> rightSub = allFullTrees(n - i);
 
      for (TreeNode l : leftSub) {
        for (TreeNode r : rightSub) {
          TreeNode root = new TreeNode(1);
          root.left = l;
          root.right = r;
          result.add(root);
        }
      }
    }
 
    return result;
  }
}
 
// h height
// T(n) = 2 * T(n - 1) * (T(1) + T(2) + ... + T(n - 1)) - T(n - 1) * T(n - 1)
class Solution2{
  public List<TreeNode> allFullTrees(int h) {
    List<TreeNode> result = new ArrayList<>();
    if (h == 0) {
      return result;
    }
 
    buildTree(h, result);
    return result;
  }
 
  private void buildTree(int h, List<TreeNode> result) {
    if (h == 0) {
      return;
    }
    if (h == 1) {
      result.add(new TreeNode(1));
      return;
    }
 
    List<TreeNode> leftSub = new ArrayList<>();
    List<TreeNode> rightSub = new ArrayList<>();
    for (int i = 1; i < h; i++) {
      buildTree(i, leftSub);
      buildTree(h - 1, rightSub);
      for (TreeNode l : leftSub) {
        for (TreeNode r : rightSub) {
          TreeNode root = new TreeNode(1);
          root.left = l;
          root.right = r;
          result.add(root);
        }
      }
      leftSub.clear();
      rightSub.clear();
 
      if (i != h - 1) {
        buildTree(i, rightSub);
        buildTree(h - 1, leftSub);
 
        for (TreeNode l : leftSub) {
          for (TreeNode r : rightSub) {
            TreeNode root = new TreeNode(1);
            root.left = l;
            root.right = r;
            result.add(root);
          }
        }
        leftSub.clear();
        rightSub.clear();
      }
    }
  }
}
Read full article from Google – Generate All Full Trees with N Leaves / h Height

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts