Leetcode 代码样例中给的字符串转数组 [0,null,1] => []string{"0", "null", "1"}.

return max value.

字符串转二叉树节点.

字符串数组转二叉树 references:[email protected]:halfrost/LeetCode-Go.git.

Inorder traversal of binary tree 中序遍历,左右根.

Postorder traversal of binary tree 后序遍历,左右根.

Preorder traversal of binary tree 前序遍历,根左右.

二叉树,转leetcode格式的层序数组,按行还原.

由数组构建二叉树,数组是程序遍历的二叉树 如 1_1 / \ 3_2 2_3 / \ \ 5_4 3_5 9_7 为[1,3,2,5,3,null,9] i*2 i*2+1 0,1,2,3,4, 5, 6 */.

空节点.