Fork me on GitHub
摘要: Invert Binary Tree 翻转二叉树 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() 阅读全文
posted @ 2021-04-21 09:35 WilliamCui 阅读(83) 评论(0) 推荐(0)
摘要: N-ary Tree Preorder Traversal N叉树前序遍历 给一个N叉树的root,返回其前序遍历 输入:root = [1,null,3,2,4,null,5,6] 输出:[1,3,5,6,2,4] /* // Definition for a Node. class Node { 阅读全文
posted @ 2021-04-21 09:30 WilliamCui 阅读(84) 评论(0) 推荐(0)