add dmarc record

; * TreeLinkNode(int x) { val = x; } * } */ public void connect(TreeLinkNode root) { if(root==null) return; List [Analysis 2-non-original] The above traversal conforms to various types of Binary Trees, not necessarily a full binary tree, but the topic limits the perfect binary tree. You can use a more concise method. For example, you can use pre. Left to determine whether to probe the bottom. Reference: https://oj.leetcode.com/discuss/7327/a-simple-accepted-sol

//// main.cpp// 【记录】自加、自减（补充）//// Created by T.P on 2018/3/7.// Copyright ? 2018年 T.P. All rights reserved.//#include This code, as we understand it, should outputval=55,7,7,5val=5In fact, its output is different depending on the "compiler", the result may be differentThe following author verifies that VS2017 and Xcode run this codeVS2017Xcode---Summary: Pits C + + programming (4th Edition), PhD, courseware explanation最后一句的输出结果4，5，4，5，这是为什么呢？我们期望的输出结果，似乎应该是：5, 7, 7, 5。这是运行顺序问题，按照从右向左的顺序计算各输出